Sciweavers

996 search results - page 81 / 200
» A general method to speed up fixed-parameter-tractable algor...
Sort
View
TIP
2002
116views more  TIP 2002»
15 years 4 months ago
Adaptive approximate nearest neighbor search for fractal image compression
Fractal image encoding is a computationally intensive method of compression due to its need to find the best match between image sub-blocks by repeatedly searching a large virtual...
Chong Sze Tong, Man Wong
GECCO
2004
Springer
15 years 10 months ago
Validating a Model of Colon Colouration Using an Evolution Strategy with Adaptive Approximations
The colour of colon tissue, which depends on the tissue structure, its optical properties, and the quantities of the pigments present in it, can be predicted by a physics-based mod...
Dzena Hidovic, Jonathan E. Rowe
DASFAA
2009
IEEE
93views Database» more  DASFAA 2009»
15 years 11 months ago
Top-K Correlation Sub-graph Search in Graph Databases
Recently, due to its wide applications, (similar) subgraph search has attracted a lot of attentions from database and data mining community, such as [13, 18, 19, 5]. In [8], Ke et ...
Lei Zou, Lei Chen 0002, Yansheng Lu
CIRA
2007
IEEE
274views Robotics» more  CIRA 2007»
15 years 11 months ago
Adaptive Object Tracking using Particle Swarm Optimization
—This paper presents an automatic object detection and tracking algorithm by using particle swarm optimization (PSO) based method, which is a searching algorithm inspired by the ...
Yuhua Zheng, Yan Meng
SIGGRAPH
2000
ACM
15 years 8 months ago
Out-of-core simplification of large polygonal models
We present an algorithm for out-of-core simplification of large polygonal datasets that are too complex to fit in main memory. The algorithm extends the vertex clustering scheme o...
Peter Lindstrom