4860 search results - page 593 / 972 » SNPs Problems, Complexity, and Algorithms |
153
click to vote
ECCV
2008
Springer
16 years 7 months ago
2008
Springer
This paper shows how computational Riemannian manifold can be used to solve several problems in computer vision and graphics. Indeed, Voronoi segmentations and Delaunay graphs comp...
154
click to vote
CPM
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. Speeding up approximate pattern matching is a line of research in stringology since the 80’s. Practically fast approaches belong to the class of filtration algorithms,...
187
click to vote
TMI
2011
14 years 12 months ago
2011
Abstract—Many practical applications require the reconstruction of images from irregularly sampled data. The spline formalism offers an attractive framework for solving this prob...
175
Voted
COMPSAC
1998
IEEE
15 years 9 months ago
1998
IEEE
Many world wide web applications require access, transfer, and synchronization of large multimedia data objects (MDOs) (such as, audio, video, and images) across the communication...
149
click to vote
CORR
2006
Springer
15 years 5 months ago
2006
Springer
Boolean satisfiability problems are an important benchmark for questions about complexity, algorithms, heuristics and threshold phenomena. Recent work on heuristics, and the satis...