1314 search results - page 217 / 263 » Approximate data mining in very large relational data |
148
click to vote
HIPC
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. This paper investigates the problem of autonomously allocating a large number of independent, equal sized tasks on a distributed heterogeneous grid-like platform, using o...
126
click to vote
DCOSS
2005
Springer
15 years 10 months ago
2005
Springer
We present an efficient distributed data structure, called the D-SPANNER, for maintaining proximity information among communicating mobile nodes. The D-SPANNER is a kinetic sparse...
141
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...
145
click to vote
VLDB
2007
ACM
15 years 10 months ago
2007
ACM
Real-world datasets exhibit a complex dependency structure among the data attributes. Learning this structure is a key task in automatic statistics configuration for query optimi...
161
click to vote
ICDM
2009
IEEE
15 years 11 months ago
2009
IEEE
—Typical information extraction (IE) systems can be seen as tasks assigning labels to words in a natural language sequence. The performance is restricted by the availability of l...