2489 search results - page 333 / 498 » On the Subgroup Distance Problem |
144
Voted
MASCOTS
2010
15 years 2 months ago
2010
—We consider the problem of optimal cluster-based data gathering in Wireless Sensor Networks (WSNs) when nearby readings are spatially correlated. Due to the dense nature of WSNs...
166
click to vote
IDEAL
2010
Springer
15 years 1 months ago
2010
Springer
World Wide Web (WWW) is a vast source of information, the problem of information overload is more acute than ever. Due to noise in WWW, it is becoming hard to find usable informati...
145
click to vote
TIP
2011
14 years 11 months ago
2011
In this paper we present a novel geometric framework called geodesic active fields for general image registration. In image registration, one looks for the underlying deformation ...
132
click to vote
JGO
2010
14 years 10 months ago
2010
The best known method to find exact or at least -approximate solutions to polynomial programming problems is the spatial Branch-and-Bound algorithm, which rests on computing lower...
206
click to vote
COMPGEOM
2011
ACM
14 years 7 months ago
2011
ACM
Many real-world data sets can be viewed of as noisy samples of special types of metric spaces called metric graphs [16]. Building on the notions of correspondence and GromovHausdo...