Sciweavers

868 search results - page 43 / 174
» A general compression algorithm that supports fast searching
Sort
View
SPIRE
2009
Springer
14 years 2 months ago
k2-Trees for Compact Web Graph Representation
The directed graph representation of the World Wide Web has been extensively used to analyze the Web structure, behavior and evolution. However, those graphs are huge and do not ï...
Nieves R. Brisaboa, Susana Ladra, Gonzalo Navarro
ICASSP
2007
IEEE
13 years 9 months ago
SIFME: A Single Iteration Fractional-Pel Motion Estimation Algorithm and Architecture for HDTV Sized H.264 Video Coding
This paper presents a set of fast algorithm and VLSI architecture for HDTV-sized H.264 fractional motion estimation. To solve the long computational latency in HD-sized applicatio...
Tzu-Yun Kuo, Yu-Kun Lin, Tian-Sheuan Chang
PUK
2003
13 years 9 months ago
Accelerating Heuristic Search in Spatial Domains
This paper exploits the spatial representation of state space problem graphs to preprocess and enhance heuristic search engines. It combines classical AI exploration with computati...
Stefan Edelkamp, Shahid Jabbar, Thomas Willhalm
ICCV
1995
IEEE
13 years 11 months ago
Fast Object Recognition in Noisy Images Using Simulated Annealing
A fast simulatedannealingalgorithmis developed for automatic object recognition. The object recognition problem is addressed as the problem of best describing a match between a hy...
Margrit Betke, Nicholas C. Makris
CIKM
2010
Springer
13 years 6 months ago
Fast query expansion using approximations of relevance models
Pseudo-relevance feedback (PRF) improves search quality by expanding the query using terms from high-ranking documents from an initial retrieval. Although PRF can often result in ...
Marc-Allen Cartright, James Allan, Victor Lavrenko...