1977 search results - page 96 / 396 » The satisfactory partition problem |
173
click to vote
MLDM
2005
Springer
15 years 11 months ago
2005
Springer
In the context of large databases, data preparation takes a greater importance : instances and explanatory attributes have to be carefully selected. In supervised learning, instanc...
207
Voted
ANTSW
2004
Springer
15 years 10 months ago
2004
Springer
ed Abstract We present two heuristic mesh-partitioning methods, both of which build on the multiple ant-colony algorithm in order to improve the quality of the mesh partitions. The...
246
click to vote
SIGMOD
2008
ACM
16 years 6 months ago
2008
ACM
Regulations require businesses to archive many electronic documents for extended periods of time. Given the sheer volume of documents and the response time requirements, documents...
163
Voted
ISPD
2003
ACM
15 years 11 months ago
2003
ACM
This paper studies the optimality, scalability and stability of stateof-the-art partitioning and placement algorithms. We present algorithms to construct two classes of benchmarks...
153
Voted
COMPGEOM
2010
ACM
15 years 11 months ago
2010
ACM
We revisit one of the most fundamental classes of data structure problems in computational geometry: range searching. Back in SoCG’92, Matouˇsek gave a partition tree method fo...