Sciweavers

1376 search results - page 266 / 276
» Searching Trees: An Essay
Sort
View
SIGIR
2004
ACM
15 years 2 months ago
Configurable indexing and ranking for XML information retrieval
Indexing and ranking are two key factors for efficient and effective XML information retrieval. Inappropriate indexing may result in false negatives and false positives, and impro...
Shaorong Liu, Qinghua Zou, Wesley W. Chu
105
Voted
UIST
2004
ACM
15 years 2 months ago
SketchREAD: a multi-domain sketch recognition engine
We present SketchREAD, a multi-domain sketch recognition engine capable of recognizing freely hand-drawn diagrammatic sketches. Current computer sketch recognition systems are dif...
Christine Alvarado, Randall Davis
89
Voted
JELIA
2004
Springer
15 years 2 months ago
tascpl: TAS Solver for Classical Propositional Logic
We briefly overview the most recent improvements we have incorporated to the existent implementations of the TAS methodology, the simplified ∆-tree representation of formulas i...
Manuel Ojeda-Aciego, Agustín Valverde
WWW
2009
ACM
15 years 2 months ago
Extracting data records from the web using tag path clustering
Fully automatic methods that extract lists of objects from the Web have been studied extensively. Record extraction, the first step of this object extraction process, identifies...
Gengxin Miao, Jun'ichi Tatemura, Wang-Pin Hsiung, ...
CCO
2001
Springer
161views Combinatorics» more  CCO 2001»
15 years 2 months ago
Branch, Cut, and Price: Sequential and Parallel
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...
Laszlo Ladányi, Ted K. Ralphs, Leslie E. Tr...