Sciweavers

2107 search results - page 346 / 422
» Computing Small Search Numbers in Linear Time
Sort
View
VISUALIZATION
1991
IEEE
14 years 15 days ago
A Tool for Visualizing the Topology of Three-Dimensional Vector Fields
We describe a software system, TOPO, that numerically analyzes and graphically displays topological aspects of a three dimensional vector field, v, to produce a single, relativel...
Al Globus, C. Levit, T. Lasinski
AIPS
2008
13 years 11 months ago
Learning Relational Decision Trees for Guiding Heuristic Planning
The current evaluation functions for heuristic planning are expensive to compute. In numerous domains these functions give good guidance on the solution, so it worths the computat...
Tomás de la Rosa, Sergio Jiménez, Da...
VISAPP
2010
13 years 9 months ago
Speeded up image matching using split and extended SIFT features
Matching feature points between images is one of the most fundamental issues in computer vision tasks. As the number of feature points increases, the feature matching rapidly becom...
Faraj Alhwarin, Danijela Ristić–Durrant and Axe...
JVCIR
2006
126views more  JVCIR 2006»
13 years 9 months ago
Efficient intra- and inter-mode selection algorithms for H.264/ AVC
Intra-frame mode selection and inter-frame mode selection are new features introduced in the H.264 standard. Intra-frame mode selection dramatically reduces spatial redundancy in ...
Andy C. Yu, King Ngi Ngan, Graham R. Martin
ARC
2007
Springer
102views Hardware» more  ARC 2007»
14 years 1 months ago
Reconfigurable Hardware Acceleration of Canonical Graph Labelling
Many important algorithms in computational biology and related subjects rely on the ability to extract and to identify sub-graphs of larger graphs; an example is to find common fun...
David B. Thomas, Wayne Luk, Michael Stumpf