1403 search results - page 222 / 281 » Set cover algorithms for very large datasets |
DEXA
2003
Springer
15 years 3 months ago
2003
Springer
Emerging applications using miniature electronic devices (e.g., tracking mobile objects using sensors) generate very large amounts of highly dynamic data that poses very high overh...
102
click to vote
EMNLP
2010
14 years 7 months ago
2010
We present a new syntactic parser that works left-to-right and top down, thus maintaining a fully-connected parse tree for a few alternative parse hypotheses. All of the commonly ...
121
click to vote
AH
2008
Springer
15 years 4 months ago
2008
Springer
In order to navigate huge document collections efficiently, tagged hierarchical structures can be used. For users, it is important to correctly interpret tag combinations. In this ...
103
click to vote
NEUROSCIENCE
2001
Springer
15 years 2 months ago
2001
Springer
We propose a theoretical framework for specification and analysis of a class of learning problems that arise in open-ended environments that contain multiple, distributed, dynamic...
STACS
2007
Springer
15 years 3 months ago
2007
Springer
The min-sum k-clustering problem is to partition a metric space (P, d) into k clusters C1, . . . , Ck ⊆ P such that k i=1 p,q∈Ci d(p, q) is minimized. We show the first effi...