- OpenBU
- →
- College of Arts and Sciences
- →
- Computer Science
- →
- Browsing Computer Science by Title
JavaScript is disabled for your browser. Some features of this site may not work without it.
Browsing Computer Science by Title
Now showing items 464-483 of 483
-
(CS Department, Boston University, 2010-05-14)Machine verification of formal arguments can only increase our confidence in the correctness of those arguments, but the costs of employing machine verification still outweigh the benefits for some common kinds of formal ...
-
(Boston University Computer Science Department, 2003-06-01)Extensible systems allow services to be configured and deployed for the specific needs of individual applications. This paper describes a safe and efficient method for user-level extensibility that requires only minimal ...
-
(CS Department, Boston University, 2010-07-23)The goal of this work was to apply lightweight formal methods to the study of the security of the JavaScript language. Previous work has shown that lightweight formal methods present a new approach to the study of security ...
-
(Boston University Computer Science Department, 2009-05-11)We propose an economic mechanism to reduce the incidence of malware that delivers spam. Earlier research proposed attention markets as a solution for unwanted messages, and showed they could provide more net benefit than ...
-
(Boston University Computer Science Department, 1995-02-21)Speculative service implies that a client's request for a document is serviced by sending, in addition to the document requested, a number of other documents (or pointers thereto) that the server speculates will be requested ...
-
(Boston University Computer Science Department, 1993-06-04)Parallel computing on a network of workstations can saturate the communication network, leading to excessive message delays and consequently poor application performance. We examine empirically the consequences of integrating ...
-
(Boston University Computer Science Department, 2000-10-17)We consider challenges associated with application domains in which a large number of distributed, networked sensors must perform a sensing task repeatedly over time. For the tasks we consider, there are three significant ...
-
(Boston University Computer Science Department, 2002-09-08)Formal tools like finite-state model checkers have proven useful in verifying the correctness of systems of bounded size and for hardening single system components against arbitrary inputs. However, conventional applications ...
-
(Boston University Computer Science Department, 1995-02-20)A problem with Speculative Concurrency Control algorithms and other common concurrency control schemes using forward validation is that committing a transaction as soon as it finishes validating, may result in a value loss ...
-
(Boston University Computer Science Department, 2009-10-01)In research areas involving mathematical rigor, there are numerous benefits to adopting a formal representation of models and arguments: reusability, automatic evaluation of examples, and verification of consistency and ...
-
(Boston University Computer Science Department, 2005-05-19)We introduce a method for recovering the spatial and temporal alignment between two or more views of objects moving over a ground plane. Existing approaches either assume that the streams are globally synchronized, so that ...
-
(CS Department, Boston University, 2010-11-10)This paper describes the scheduling framework for a new operating system called "Quest". The three main goals of Quest are to ensure safety, predictability and efficiency of software execution. For this paper, we focus on ...
-
(Boston University Computer Science Department, 2004-03-23)This paper presents a new approach to window-constrained scheduling, suitable for multimedia and weakly-hard real-time systems. We originally developed an algorithm, called Dynamic Window-Constrained Scheduling (DWCS), ...
-
(Boston University Computer Science Department, 1997-07-10)We propose a new characterization of protein structure based on the natural tetrahedral geometry of the β carbon and a new geometric measure of structural similarity, called visible volume. In our model, the side-chains ...
-
(Boston University Computer Science Department, 2001)Recent measurement based studies reveal that most of the Internet connections are short in terms of the amount of traffic they carry (mice), while a small fraction of the connections are carrying a large portion of the ...
-
(Boston University Computer Science Department, 2006-05-11)We present a highly accurate method for classifying web pages based on link percentage, which is the percentage of text characters that are parts of links normalized by the number of all text characters on a web page. ...
-
(Boston University Computer Science Department, 1996-10-10)Document publication service over such a large network as the Internet challenges us to harness available server and network resources to meet fast growing demand. In this paper, we show that large-scale dynamic caching ...
-
(Boston University Computer Science Department, 2000-10-19)Abstract: The Ambient Calculus was developed by Cardelli and Gordon as a formal framework to study issues of mobility and migrant code. We consider an Ambient Calculus where ambients transport and exchange programs rather ...
-
(Boston University Computer Science Department, 2008-01-15)Wireless Intrusion Detection Systems (WIDS) monitor 802.11 wireless frames (Layer-2) in an attempt to detect misuse. What distinguishes a WIDS from a traditional Network IDS is the ability to utilize the broadcast nature ...
-
(Boston University Computer Science Department, 1995-05-27)We propose the development of a world wide web image search engine that crawls the web collecting information about the images it finds, computes the appropriate image decompositions and indices, and stores this extracted ...
Now showing items 464-483 of 483
