3875 search results - page 608 / 775 » Approximation algorithms for the 0-extension problem |
154
click to vote
INFOCOM
2009
IEEE
16 years 1 months ago
2009
IEEE
—Sensor network localization is an instance of the NP-HARD graph realization problem. Thus, methods used in practice are not guaranteed to find the correct localization, even if...
163
click to vote
SMI
2008
IEEE
16 years 26 days ago
2008
IEEE
In this paper a novel clustering algorithm is proposed, namely Variational Multilevel Mesh Clustering (VMLC). The algorithm incorporates the advantages of both hierarchical and va...
152
click to vote
ISSAC
2007
Springer
16 years 19 days ago
2007
Springer
Consider a rational matrix, particularly one whose entries have large numerators and denominators, but which is presented as a product of very sparse matrices with relatively smal...
174
click to vote
WABI
2007
Springer
16 years 18 days ago
2007
Springer
Christopher James Langmead⋆ and Sumit Kumar Jha Department of Computer Science, Carnegie Mellon University We present a novel approach for predicting protein folding kinetics us...
136
click to vote
ICMCS
2006
IEEE
16 years 16 days ago
2006
IEEE
Removal of rain streaks in video is a challenging problem due to the random spatial distribution and fast motion of rain. This paper presents a new rain removal algorithm that inc...