2252 search results - page 448 / 451 » Lower Bounds for Dynamic Algorithms |
WWW
2003
ACM
14 years 8 months ago
2003
ACM
RDF-based P2P networks have a number of advantages compared with simpler P2P networks such as Napster, Gnutella or with approaches based on distributed indices such as CAN and CHO...
POPL
2007
ACM
14 years 7 months ago
2007
ACM
This paper is concerned with a programming language construct for typed name binding that enforces -equivalence. It proves a new result about what operations on names can co-exist...
SIGMOD
2009
ACM
14 years 7 months ago
2009
ACM
We consider the problem of collectively approximating a set of sensor signals using the least amount of space so that any individual signal can be efficiently reconstructed within...
GIS
2009
ACM
14 years 2 months ago
2009
ACM
In this paper, we formalize the novel concept of Constrained Reverse k-Nearest Neighbor (CRkNN) search on mobile objects (clients) performed at a central server. The CRkNN query c...
BTW
2009
Springer
14 years 2 months ago
2009
Springer
: Users of front office applications such as call center or customer support applications make millions and millions of decisions each day without analytical support. For example, ...