4198 search results - page 60 / 840 » In search of lost time |
171
click to vote
STOC
2006
ACM
16 years 6 months ago
2006
ACM
We present a new data structure that facilitates approximate nearest neighbor searches on a dynamic set of points in a metric space that has a bounded doubling dimension. Our data...
154
click to vote
CSCLP
2005
Springer
15 years 11 months ago
2005
Springer
CSP search algorithms are exponential in the worst-case. A trivial upper bound on the time complexity of CSP search algorithms is O∗ (dn ), where n and d are the number of variab...
188
click to vote
PETRA
2009
ACM
16 years 10 days ago
2009
ACM
Event search is the problem of identifying events or activity of interest in a large database storing long sequences of activity. In this paper, our topic is the problem of identi...
179
click to vote
INFOCOM
2009
IEEE
16 years 14 days ago
2009
IEEE
—Motivated by streaming applications with stringent delay constraints, we consider the design of online network coding algorithms with timely delivery guarantees. Assuming that t...
143
click to vote
ESA
2003
Springer
15 years 11 months ago
2003
Springer
We consider a network providing Differentiated Services (DiffServ), which allow Internet Service Providers (ISP’s) to offer different levels of Quality of Service (QoS) to diffe...