1632 search results - page 281 / 327 » Sublinear Time Algorithms for Metric Space Problems |
143
Voted
KDD
2000
ACM
15 years 7 months ago
2000
ACM
Many important problems involve clustering large datasets. Although naive implementations of clustering are computationally expensive, there are established efficient techniques f...
173
Voted
MOBIDE
2006
ACM
15 years 9 months ago
2006
ACM
An important problem in mobile ad-hoc wireless sensor networks is the localization of individual nodes, i.e., each node’s awareness of its position relative to the network. In t...
173
click to vote
SMA
2009
ACM
15 years 10 months ago
2009
ACM
We present the “Dynamic Packing Grid” (DPG) data structure along with details of our implementation and performance results, for maintaining and manipulating flexible molecul...
153
Voted
AIPS
2010
15 years 4 months ago
2010
Efficient management and propagation of temporal constraints is important for temporal planning as well as for scheduling. During plan development, new events and temporal constra...
129
Voted
AAAI
2010
15 years 5 months ago
2010
g Without a Heuristic: Efficient Use of Abstraction Bradford Larsen, Ethan Burns, Wheeler Ruml Department of Computer Science University of New Hampshire Durham, NH 03824 USA blars...