- 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 96-115 of 483
-
(Boston University Computer Science Department, 2003-04-01)Estimation of 3D hand pose is useful in many gesture recognition applications, ranging from human-computer interaction to automated recognition of sign languages. In this paper, 3D hand pose estimation is treated as a ...
-
(Boston University Computer Science Department, 2002-01-11)The SafeWeb anonymizing system has been lauded by the press and loved by its users; self-described as "the most widely used online privacy service in the world," it served over 3,000,000 page views per day at its peak. ...
-
(Boston University Computer Science Department, 2000-04-01)The isomorphisms holding in all models of the simply typed lambda calculus with surjective and terminal objects are well studied - these models are exactly the Cartesian closed categories. Isomorphism of two simple types ...
-
(Boston University Computer Science Department, 2008-07-12)Transport protocols are an integral part of the inter-process communication (IPC) service used by application processes to communicate over the network infrastructure. With almost 30 years of research on transport, one ...
-
(Boston University Computer Science Department, 1995-09-12)We describe a method for shape-based image database search that uses deformable prototypes to represent categories. Rather than directly comparing a candidate shape with all shape entries in the database, shapes are compared ...
-
(Boston University Computer Science Department, 1998-12-04)A method for deformable shape detection and recognition is described. Deformable shape templates are used to partition the image into a globally consistent interpretation, determined in part by the minimum description ...
-
(Boston University Computer Science Department, 1995-02-07)We analyzed the logs of our departmental HTTP server http://cs-www.bu.edu as well as the logs of the more popular Rolling Stones HTTP server http://www.stones.com. These servers have very different purposes; the former ...
-
(CS Department, Boston University, 2010-11-10)Computer systems are increasingly driven by workloads that reflect large-scale social behavior, such as rapid changes in the popularity of media items like videos. Capacity planners and system designers must plan for rapid, ...
-
(Boston University Computer Science Department, 1998-09-02)Statistical Rate Monotonic Scheduling (SRMS) is a generalization of the classical RMS results of Liu and Layland [LL73] for periodic tasks with highly variable execution times and statistical QoS requirements. The main ...
-
(Boston University Computer Science Department, 2005-06-13)This paper proposes a method for detecting shapes of variable structure in images with clutter. The term "variable structure" means that some shape parts can be repeated an arbitrary number of times, some parts can be ...
-
(Boston University Computer Science Department, 1998-04-02)It is shown that determining whether a quantum computation has a non-zero probability of accepting is at least as hard as the polynomial time hierarchy. This hardness result also applies to determining in general whether ...
-
(Boston University Computer Science Department, 2000-01-20)It is shown that determining whether a quantum computation has a non-zero probability of accepting is at least as hard as the polynomial time hierarchy. This hardness result also applies to determining in general whether ...
-
(Boston University Computer Science Department, 1997-03-26)World-Wide Web (WWW) services have grown to levels where significant delays are expected to happen. Techniques like pre-fetching are likely to help users to personalize their needs, reducing their waiting times. However, ...
-
(Boston University Computer Science Department, 1995-11-18)Consider a network of processors (sites) in which each site x has a finite set N(x) of neighbors. There is a transition function f that for each site x computes the next state ξ(x) from the states in N(x). But these ...
-
(Boston University Computer Science Department, 2008-02-10)Commonly, research work in routing for delay tolerant networks (DTN) assumes that node encounters are predestined, in the sense that they are the result of unknown, exogenous processes that control the mobility of these ...
-
(Boston University Computer Science Department, 2004-02-24)Anomalies are unusual and significant changes in a network's traffic levels, which can often involve multiple links. Diagnosing anomalies is critical for both network operators and end users. It is a difficult problem ...
-
(Boston University Computer Science Department, 2002)Internet measurements show that the size distribution of Web-based transactions is usually very skewed; a few large requests constitute most of the total traffic. Motivated by the advantages of scheduling algorithms which ...
-
(Boston University Computer Science Department, 2000-05-17)The majority of the traffic (bytes) flowing over the Internet today have been attributed to the Transmission Control Protocol (TCP). This strong presence of TCP has recently spurred further investigations into its congestion ...
-
(Boston University Computer Science Department, 2004-05-31)Wireless sensor networks have recently emerged as enablers of important applications such as environmental, chemical and nuclear sensing systems. Such applications have sophisticated spatial-temporal semantics that set ...
-
(Boston University Department of Computer Science, 1993-12-01)We study the problem of type inference for a family of polymorphic type disciplines containing the power of Core-ML. This family comprises all levels of the stratification of the second-order lambda-calculus by "rank" of ...
Now showing items 96-115 of 483
