1554 search results - page 102 / 311 » Parameterized Complexity and Approximation Algorithms |
104
click to vote
CORR
2008
Springer
15 years 3 months ago
2008
Springer
In many physical statistical, biological and other investigations it is desirable to approximate a system of points by objects of lower dimension and/or complexity. For this purpo...
161
click to vote
CVPR
1997
IEEE
16 years 5 months ago
1997
IEEE
Shape indexing is a way of making rapid associations between features detected in an image and object models that could have produced them. When model databases are large, the use...
169
Voted
CVPR
2004
IEEE
16 years 5 months ago
2004
IEEE
Weighted graph matching is a good way to align a pair of shapes represented by a set of descriptive local features; the set of correspondences produced by the minimum cost matchin...
183
click to vote
AI
2011
Springer
14 years 7 months ago
2011
Springer
Probabilistic inference in graphical models is a prevalent task in statistics and artificial intelligence. The ability to perform this inference task efficiently is critical in l...
130
click to vote
COCOON
2007
Springer
15 years 10 months ago
2007
Springer
The last decade witnessed the extensive studies of algorithms for data streams. In this model, the input is given as a sequence of items passing only once or a few times, and we ar...