16504 search results - page 3023 / 3301 » New Problems, New Solutions |
228
click to vote
FOCS
2010
IEEE
15 years 4 months ago
2010
IEEE
We consider k-median clustering in finite metric spaces and k-means clustering in Euclidean spaces, in the setting where k is part of the input (not a constant). For the k-means pr...
202
click to vote
IMC
2010
ACM
15 years 4 months ago
2010
ACM
How fast is the network? The speed at which real users can download content at different locations and at different times is an important metric for service providers. Knowledge o...
180
click to vote
OPODIS
2010
15 years 4 months ago
2010
: Provide application processes with strong agreement guarantees despite failures is a fundamental problem of fault-tolerant distributed computing. Correct processes have not to be...
175
Voted
CORR
2010
Springer
15 years 4 months ago
2010
Springer
In this paper we derive aggregate separation bounds, named after Davenport-MahlerMignotte (DMM), on the isolated roots of polynomial systems, specifically on the minimum distance ...
245
click to vote
CVPR
2011
IEEE
15 years 3 months ago
2011
IEEE
Conventional rigid structure from motion (SFM) addresses the problem of recovering the camera parameters (motion) and the 3D locations (structure) of scene points, given observed ...