- 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 278-297 of 483
-
(Boston University Computer Science Department, 2006-10-02)Hidden State Shape Models (HSSMs) [2], a variant of Hidden Markov Models (HMMs) [9], were proposed to detect shape classes of variable structure in cluttered images. In this paper, we formulate a probabilistic framework ...
-
(Boston University Computer Science Department, 2009-05-18)Establishing correspondences among object instances is still challenging in multi-camera surveillance systems, especially when the cameras’ fields of view are non-overlapping. Spatiotemporal constraints can help in solving ...
-
(Boston University Computer Science Department, 1995-07-18)This report describes our attempt to add animation as another data type to be used on the World Wide Web. Our current network infrastructure, the Internet, is incapable of carrying video and audio streams for them to be ...
-
(CS Department, Boston University, 2010-07-06)We propose an approach for improving object recognition and localization using spatial kernels together with instance embedding. Our approach treats each image as a bag of instances (image features) within a multiple ...
-
(CS Department, Boston University, 2010-07-06)In many cases, human actions can be identified not only by the singular observation of the human body in motion, but also properties of the surrounding scene and the related objects. In this paper, we look into this problem ...
-
(Boston University Computer Science Department, 1998-09-02)Most real-time scheduling problems are known to be NP-complete. To enable accurate comparison between the schedules of heuristic algorithms and the optimal schedule, we introduce an omniscient oracle. This oracle provides ...
-
(Boston University Computer Science Department, 2001)The congestion control mechanisms of TCP make it vulnerable in an environment where flows with different congestion-sensitivity compete for scarce resources. With the increasing amount of unresponsive UDP traffic in today's ...
-
(Boston University Computer Science Department, 2006-02-22)The need for the ability to cluster unknown data to better understand its relationship to know data is prevalent throughout science. Besides a better understanding of the data itself or learning about a new unknown object, ...
-
(Boston University Computer Science Department, 2009-06-05)We consider a fault model of Boolean gates, both classical and quantum, where some of the inputs may not be connected to the actual gate hardware. This model is somewhat similar to the stuck-at model which is a very popular ...
-
(Boston University Computer Science Department, 1993-12)We investigate the problem of learning disjunctions of counting functions, which are general cases of parity and modulo functions, with equivalence and membership queries. We prove that, for any prime number p, the class ...
-
(Boston University Computer Science Department, 2005-06-03)Nearest neighbor classifiers are simple to implement, yet they can model complex non-parametric distributions, and provide state-of-the-art recognition accuracy in OCR databases. At the same time, they may be too slow for ...
-
(CS Department, Boston University, 2010-07-02)Modern chip-level multiprocessors (CMPs) contain multiple processor cores sharing a common last-level cache, memory interconnects, and other hardware resources. Workloads running on separate cores compete for these resources, ...
-
(Boston University Computer Science Department, 2008-08-15)We present an online distributed algorithm, the Causation Logging Algorithm (CLA), in which Autonomous Systems (ASes) in the Internet individually report route oscillations/flaps they experience to a central Internet Routing ...
-
(CS Department, Boston University, 2010-09-07)Although vehicular ad hoc networks are emerging as a novel paradigm for safety services, supporting real-time applications (e.g., video-streaming, Internet browsing, online gaming, etc.) while maintaining ubiquitous ...
-
(CS Department, Boston University, 2010-10-15)As the Internet has evolved and grown, an increasing number of nodes (hosts or autonomous systems) have become multihomed, i.e., a node is connected to more than one network. Mobility can be viewed as a special case of ...
-
(Boston University Computer Science Department, 2000-01-20)For any q > 1, let MOD_q be a quantum gate that determines if the number of 1's in the input is divisible by q. We show that for any q,t > 1, MOD_q is equivalent to MOD_t (up to constant depth). Based on the case q=2, ...
-
(Boston University Computer Science Department, 2003-02-06)Accurate knowledge of traffic demands in a communication network enables or enhances a variety of traffic engineering and network management tasks of paramount importance for operational networks. Directly measuring a ...
-
(Boston University Computer Science Department, 2009-06-19)As the Internet has evolved and grown, an increasing number of nodes (hosts or autonomous systems) have become multihomed, i.e., a node is connected to more than one network. Mobility can be viewed as a special case of ...
-
(CS Department, Boston University, 2010-04-27)The dynamic policy routing model (DPR) was recently introduced to explicitly model the dynamics of policy routing. DPR extends the formalism of the stable paths problem with discrete synchronous time to capture the propagation ...
-
(Boston University Computer Science Department, 1994-11-10)In this paper, we study the efficacy of genetic algorithms in the context of combinatorial optimization. In particular, we isolate the effects of cross-over, treated as the central component of genetic search. We show that ...
Now showing items 278-297 of 483
