Sciweavers

446 search results - page 10 / 90
» Multiple voting location problems
Sort
View
COMPSAC
2002
IEEE
15 years 2 months ago
Achieving Scalability in Hierarchical Location Services
Services for locating mobile objects are often organized as a distributed search tree. The advantage of such an organization is that the service can easily scale as a distributed ...
Maarten van Steen, Gerco Ballintijn
SPC
2005
Springer
15 years 3 months ago
On the Anonymity of Periodic Location Samples
As Global Positioning System (GPS) receivers become a common feature in cell phones, personal digital assistants, and automobiles, there is a growing interest in tracking larger us...
Marco Gruteser, Baik Hoh
ATAL
2008
Springer
14 years 11 months ago
Complexity of terminating preference elicitation
Complexity theory is a useful tool to study computational issues surrounding the elicitation of preferences, as well as the strategic manipulation of elections aggregating togethe...
Toby Walsh
ICCV
2009
IEEE
16 years 2 months ago
FLoSS: Facility Location for Subspace Segmentation
Subspace segmentation is the task of segmenting data lying on multiple linear subspaces. Its applications in computer vision include motion segmentation in video, structure-from...
Nevena Lazic, Inmar Givoni, Brendan Frey
ICPR
2002
IEEE
15 years 10 months ago
Bayesian Pot-Assembly from Fragments as Problems in Perceptual-Grouping and Geometric-Learning
A heretofore unsolved problem of great archaeological importance is the automatic assembly of pots made on a wheel from the hundreds (or thousands) of sherds found at an excavatio...
David B. Cooper, Andrew R. Willis, Stuart Andrews,...