1399 search results - page 242 / 280 » New Algorithms for k-Center and Extensions |
181
click to vote
IJCAI
2007
15 years 7 months ago
2007
A central goal of robotics and AI is to be able to deploy an agent to act autonomously in the real world over an extended period of time. It is commonly asserted that in order to ...
171
click to vote
BMCBI
2007
15 years 5 months ago
2007
Background: The definition of a distance measure plays a key role in the evaluation of different clustering solutions of gene expression profiles. In this empirical study we compa...
165
Voted
DEBU
2010
15 years 5 months ago
2010
Databases supporting time dependent and continuously changing geometries, called moving objects databases, have been studied for about 15 years. The field has been flourishing and...
184
click to vote
SIAMJO
2002
15 years 5 months ago
2002
Given an undirected graph with positive weights on the vertices, the maximum weight clique problem (MWCP) is to find a subset of mutually adjacent vertices (i.e., a clique) having ...
158
click to vote
FOCS
2008
IEEE
16 years 2 hour ago
2008
IEEE
Abstract— We consider the approximate sparse recovery problem, where the goal is to (approximately) recover a highdimensional vector x ∈ Rn from its lower-dimensional sketch Ax...