7930 search results - page 437 / 1586 » Greedy in Approximation Algorithms |
165
click to vote
INFOCOM
2006
IEEE
16 years 27 days ago
2006
IEEE
— We propose efficient distributed algorithms to aid navigation of a user through a geographic area covered by sensors. The sensors sense the level of danger at their locations ...
190
click to vote
ISAAC
2001
Springer
15 years 11 months ago
2001
Springer
A fragmentary pattern is a multiset of non-empty strings, and it matches a string w if all the strings in it occur within w without any overlaps. We study some fundamental issues o...
186
click to vote
SIGGRAPH
1993
ACM
15 years 11 months ago
1993
ACM
Many of the current radiosity algorithms create a piecewise constant approximation to the actual radiosity. Through interpolation and extrapolation, a continuous solution is obtai...
168
Voted
NIPS
2008
15 years 8 months ago
2008
Continuously-Adaptive Discretization for Message-Passing (CAD-MP) is a new message-passing algorithm for approximate inference. Most message-passing algorithms approximate continu...
202
click to vote
JMIV
2010
15 years 1 months ago
2010
This paper proposes robust algorithms to deconvolve discrete noised signals and images. The solutions are derived as linear combinations of spline wavelet packets that minimize so...