5595 search results - page 334 / 1119 » Approximation Algorithms for Clustering Problems |
155
click to vote
ICDM
2007
IEEE
16 years 1 months ago
2007
IEEE
Typical clustering algorithms output a single clustering of the data. However, in real world applications, data can often be interpreted in many different ways; data can have diff...
167
click to vote
WASA
2009
Springer
16 years 1 months ago
2009
Springer
In this paper, we consider Multiple-Sink Data Collection Problem in wireless sensor networks, where a large amount of data from sensor nodes need to be transmitted to one of multip...
165
click to vote
CP
2008
Springer
15 years 8 months ago
2008
Springer
The Constraint Satisfaction Problem (CSP) framework allows users to define problems in a declarative way, quite independently from the solving process. However, when the problem i...
188
click to vote
FOCS
2008
IEEE
16 years 1 months ago
2008
IEEE
This work investigates a geometric approach to proving cell probe lower bounds for data structure problems. We consider the approximate nearest neighbor search problem on the Bool...
177
click to vote
ENDM
2006
15 years 6 months ago
2006
We consider a dynamic planning problem for paratransit transportation. The focus is on a decision to take one day ahead: which requests to serve with own vehicles, and which reque...