1382 search results - page 71 / 277 » Formal Analysis of Online Algorithms |
157
click to vote
CVPR
2006
IEEE
16 years 8 months ago
2006
IEEE
This paper develops an efficient new method for 3D partial shape retrieval. First, a Monte Carlo sampling strategy is employed to extract local shape signatures from each 3D model...
141
click to vote
SSPR
2004
Springer
15 years 11 months ago
2004
Springer
Kernel Methods are a class of algorithms for pattern analysis with a number of convenient features. They can deal in a uniform way with a multitude of data types and can be used to...
162
click to vote
SAS
2009
Springer
16 years 6 months ago
2009
Springer
Abstract. While the tightest proven worst-case complexity for Andersen's points-to analysis is nearly cubic, the analysis seems to scale better on real-world codes. We examine...
167
click to vote
FORTE
2009
15 years 3 months ago
2009
Abstract. We propose a verification method for parameterized systems with global conditions. The method is based on context-sensitive constraints, a symbolic representation of infi...
143
click to vote
ISCAS
2008
IEEE
16 years 9 days ago
2008
IEEE
— Many source separation algorithms fail to deliver robust performance in presence of artifacts introduced by cross-channel redundancy, non-homogeneous mixing and highdimensional...