Sciweavers

6266 search results - page 105 / 1254
» New results on the computability and complexity of points - ...
Sort
View
COCOON
1999
Springer
14 years 1 months ago
A New Approach for Speeding Up Enumeration Algorithms and Its Application for Matroid Bases
Abstract: We propose a new approach for speeding up enumeration algorithms. The approach does not rely on data structures deeply, instead utilizes analysis of computation time. It ...
Takeaki Uno
ICCV
2003
IEEE
14 years 2 months ago
Markov-Based Failure Prediction for Human Motion Analysis
This paper presents a new method of detecting and predicting motion tracking failures with applications in human motion and gait analysis. We define a tracking failure as an event...
Shiloh L. Dockstader, Nikita S. Imennov, A. Murat ...
CIE
2008
Springer
13 years 11 months ago
Many Facets of Complexity in Logic
There are many ways to define complexity in logic. In finite model theory, it is the complexity of describing properties, whereas in proof complexity it is the complexity of provin...
Antonina Kolokolova
CVPR
2007
IEEE
14 years 11 months ago
Incremental Linear Discriminant Analysis Using Sufficient Spanning Set Approximations
This paper presents a new incremental learning solution for Linear Discriminant Analysis (LDA). We apply the concept of the sufficient spanning set approximation in each update st...
Björn Stenger, Josef Kittler, Roberto Cipolla...
GIS
2004
ACM
14 years 10 months ago
A new approach for a topographic feature-based characterization of digital elevation data
Triangular Irregular Network (TIN) and Regular Square Grid (RSG) are widely used for representing 2.5 dimensional spatial data. However, these models are not defined from the topo...
Eric Saux, Ki-Joune Li, Min-Hwan Kim, Rémy ...