Sciweavers

224 search results - page 43 / 45
» Bounding Learning Time in XCS
Sort
View
SIGMOD
2010
ACM
324views Database» more  SIGMOD 2010»
14 years 5 days ago
Similarity search and locality sensitive hashing using ternary content addressable memories
Similarity search methods are widely used as kernels in various data mining and machine learning applications including those in computational biology, web search/clustering. Near...
Rajendra Shinde, Ashish Goel, Pankaj Gupta, Debojy...
IFIP
2004
Springer
14 years 22 days ago
The Inherent Queuing Delay of Parallel Packet Switches
The parallel packet switch (PPS) extends the inverse multiplexing architecture, and is extensively used as the core of contemporary commercial switches. A key factor in the perfor...
Hagit Attiya, David Hay
APPROX
2006
Springer
89views Algorithms» more  APPROX 2006»
13 years 11 months ago
Online Algorithms to Minimize Resource Reallocations and Network Communication
Abstract. In this paper, we consider two new online optimization problems (each with several variants), present similar online algorithms for both, and show that one reduces to the...
Sashka Davis, Jeff Edmonds, Russell Impagliazzo
INFOCOM
2009
IEEE
14 years 2 months ago
Online Bipartite Perfect Matching With Augmentations
—In this paper, we study an online bipartite matching problem, motivated by applications in wireless communication, content delivery, and job scheduling. In our problem, we have ...
Kamalika Chaudhuri, Constantinos Daskalakis, Rober...
ECCV
2008
Springer
14 years 9 months ago
Multi-layered Decomposition of Recurrent Scenes
Abstract. There is considerable interest in techniques capable of identifying anomalies and unusual events in busy outdoor scenes, e.g. road junctions. Many approaches achieve this...
David Mark Russell, Shaogang Gong