5595 search results - page 386 / 1119 » Approximation Algorithms for Clustering Problems |
211
click to vote
ILP
2004
Springer
16 years 5 days ago
2004
Springer
One challenge faced by many Inductive Logic Programming (ILP) systems is poor scalability to problems with large search spaces and many examples. Randomized search methods such as ...
202
click to vote
JCP
2007
15 years 6 months ago
2007
Abstract— Data synopsis is a lossy compressed representation of data stored into databases that helps the query optimizer to speed up the query process, e.g. time to retrieve the...
205
click to vote
EUROPAR
2004
Springer
15 years 10 months ago
2004
Springer
Hierarchical agglomerative clustering (HAC) is a common clustering method that outputs a dendrogram showing all N levels of agglomerations where N is the number of objects in the d...
203
click to vote
JPDC
2007
15 years 6 months ago
2007
The increasing popular personal communications and mobile computing require a wireless network infrastructure that supports selfconfiguration and self-management. Efficient clus...
174
click to vote
IPSN
2007
Springer
16 years 28 days ago
2007
Springer
We consider the problem of approximating a family of isocontours in a sensor field with a topologically-equivalent family of simple polygons. Our algorithm is simple and distribu...