1632 search results - page 224 / 327 » Sublinear Time Algorithms for Metric Space Problems |
113
click to vote
PODS
2010
ACM
15 years 9 months ago
2010
ACM
A fundamental problem in data management is to draw a sample of a large data set, for approximate query answering, selectivity estimation, and query planning. With large, streamin...
130
click to vote
EUMAS
2006
15 years 5 months ago
2006
Forming effective coalitions is a major research challenge in the field of multi-agent systems. Central to this endeavour is the problem of determining the best set of agents that...
137
click to vote
WABI
2007
Springer
15 years 10 months ago
2007
Springer
Christopher James Langmead⋆ and Sumit Kumar Jha Department of Computer Science, Carnegie Mellon University We present a novel approach for predicting protein folding kinetics us...
151
click to vote
DMIN
2007
15 years 5 months ago
2007
- Several algorithms have been introduced for mining frequent itemsets. The recent datasettransformation approach suffers either from the possible increasing in the number of struc...
180
click to vote
WADS
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. A Semi-Separated Pair Decomposition (SSPD), with parameter s > 1, of a set S ⊂ Rd is a set {(Ai, Bi)} of pairs of subsets of S such that for each i, there are balls ...