Sciweavers

1021 search results - page 72 / 205
» Fast Approximate PCPs
Sort
View
127
Voted
SPIRE
2007
Springer
15 years 9 months ago
A Fast and Compact Web Graph Representation
Compressed graphs representation has become an attractive research topic because of its applications to the manipulation of huge Web graphs in main memory. By far the best current ...
Francisco Claude, Gonzalo Navarro
3DPVT
2006
IEEE
189views Visualization» more  3DPVT 2006»
15 years 9 months ago
Fast Safe Spline Surrogates for Large Point Clouds
To support real-time computation with large, possibly evolving point clouds and range data, we fit a trimmed uniform tensor-product spline function from one direction. The graph ...
Ashish Myles, Jörg Peters
ICANN
2003
Springer
15 years 8 months ago
Meta-learning for Fast Incremental Learning
Model based learning systems usually face to a problem of forgetting as a result of the incremental learning of new instances. Normally, the systems have to re-learn past instances...
Takayuki Oohira, Koichiro Yamauchi, Takashi Omori
EVOW
2006
Springer
15 years 6 months ago
Fast EAX Algorithm Considering Population Diversity for Traveling Salesman Problems
This paper proposes an evolutionary algorithm (EA) that is applied to the traveling salesman problem (TSP). Existing approximation methods to address the TSP known to be state-of-t...
Yuichi Nagata
ICIP
1995
IEEE
15 years 6 months ago
Fast image search using a multiscale stochastic model
Searching an image for the occurrence of a pattern or a template is an essential step in a number of image processing applications. We propose a new multiresolution matching crite...
S. Sista, Charles A. Bouman, Jan P. Allebach