14078 search results - page 314 / 2816 » Design and Analysis of Computer Algorithms |
149
click to vote
CVPR
2006
IEEE
16 years 8 months ago
2006
IEEE
Near regular textures are pervasive in man-made and natural world. Their global regularity and local randomness pose new difficulties to the state of the art texture analysis and ...
183
click to vote
DSD
2008
IEEE
16 years 1 months ago
2008
IEEE
Abstract—In two recent contributions [1], [2], we have provided a comparative analysis of various optimization algorithms, which can be used for atomic location estimation, and s...
165
click to vote
STACS
2004
Springer
16 years 1 days ago
2004
Springer
We present an improved average case analysis of the maximum cardinality matching problem. We show that in a bipartite or general random graph on n vertices, with high probability ...
170
click to vote
ISSAC
1997
Springer
15 years 10 months ago
1997
Springer
Las Vegas algorithms that are based on Lanczos’s method for solving symmetric linear systems are presented and analyzed. These are compared to a similar randomized Lanczos algor...
171
click to vote
CVPR
1999
IEEE
16 years 8 months ago
1999
IEEE
Facial variation divides into a number of functional subspaces. An improved method of measuring these was designed, within the space defined by an Appearance Model. Initial estima...