49 search results - page 10 / 10 » Localization: Approximation and Performance Bounds to Minimi... |
TKDE
2008
13 years 5 months ago
2008
Given a dataset P, a k-means query returns k points in space (called centers), such that the average squared distance between each point in P and its nearest center is minimized. S...
INFOCOM
2007
IEEE
13 years 11 months ago
2007
IEEE
— Power efficient operation is very critical in energy constrained multi-hop wireless networks. One important technique is to intelligently assign transmission powers to nodes w...
ANOR
2007
13 years 5 months ago
2007
The min-SHIFT DESIGN problem (MSD) is an important scheduling problem that needs to be solved in many industrial contexts. The issue is to find a minimum number of shifts and the...
SIGMOD
2010
ACM
13 years 10 months ago
2010
ACM
Fast query processing of complex objects, e.g. spatial or uncertain objects, depends on efficient spatial pruning of the objects’ approximations, which are typically minimum bou...