Sciweavers

5022 search results - page 789 / 1005
» Data structures and problem solving using Java
Sort
View
IR
2008
15 years 7 months ago
Output-sensitive autocompletion search
We consider the following autocompletion search scenario: imagine a user of a search engine typing a query; then with every keystroke display those completions of the last query wo...
Holger Bast, Christian Worm Mortensen, Ingmar Webe...
CORR
2012
Springer
272views Education» more  CORR 2012»
14 years 2 months ago
Fast and Exact Top-k Search for Random Walk with Restart
Graphs are fundamental data structures and have been employed for centuries to model real-world systems and phenomena. Random walk with restart (RWR) provides a good proximity sco...
Yasuhiro Fujiwara, Makoto Nakatsuji, Makoto Onizuk...
WWW
2007
ACM
16 years 7 months ago
U-REST: an unsupervised record extraction system
In this paper, we describe a system that can extract record structures from web pages with no direct human supervision. Records are commonly occurring HTML-embedded data tuples th...
Yuan Kui Shen, David R. Karger
CVPR
2005
IEEE
16 years 9 months ago
Learning Spatiotemporal T-Junctions for Occlusion Detection
The goal of motion segmentation and layer extraction can be viewed as the detection and localization of occluding surfaces. A feature that has been shown to be a particularly stro...
Nicholas Apostoloff, Andrew W. Fitzgibbon
173
Voted
MICRO
2006
IEEE
73views Hardware» more  MICRO 2006»
16 years 1 months ago
Merging Head and Tail Duplication for Convergent Hyperblock Formation
VLIW and EDGE (Explicit Data Graph Execution) architectures rely on compilers to form high-quality hyperblocks for good performance. These compilers typically perform hyperblock f...
Bertrand A. Maher, Aaron Smith, Doug Burger, Kathr...