Sciweavers

3223 search results - page 466 / 645
» The Scaling of Search Cost
Sort
View
MM
1994
ACM
143views Multimedia» more  MM 1994»
15 years 10 months ago
Quad-Tree Segmentation for Texture-Based Image Query
In this paper we propose a technique for segmenting images by texture content with application to indexing images in a large image database. Using a quad-tree decomposition, textu...
Jonathan M. Smith, Shih-Fu Chang
ARC
2007
Springer
102views Hardware» more  ARC 2007»
15 years 10 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
CCGRID
2007
IEEE
15 years 10 months ago
A Hybrid Linear Programming and Evolutionary Algorithm based Approach for On-line Resource Matching in Grid Environments
We describe a hybrid linear programming (LP) and evolutionary algorithm (EA) based resource matcher suitable for heterogeneous grid environments. The hybrid matcher adopts the ite...
Pawel Garbacki, Vijay K. Naik
CIKM
2009
Springer
15 years 10 months ago
Suffix trees for very large genomic sequences
A suffix tree is a fundamental data structure for string searching algorithms. Unfortunately, when it comes to the use of suffix trees in real-life applications, the current metho...
Marina Barsky, Ulrike Stege, Alex Thomo, Chris Upt...
DIS
2007
Springer
15 years 10 months ago
Time and Space Efficient Discovery of Maximal Geometric Graphs
A geometric graph is a labeled graph whose vertices are points in the 2D plane with an isomorphism invariant under geometric transformations such as translation, rotation, and scal...
Hiroki Arimura, Takeaki Uno, Shinichi Shimozono