Sciweavers

5065 search results - page 953 / 1013
» Searching in Document Images
Sort
View
PPOPP
2003
ACM
15 years 5 months ago
Optimizing data aggregation for cluster-based internet services
Large-scale cluster-based Internet services often host partitioned datasets to provide incremental scalability. The aggregation of results produced from multiple partitions is a f...
Lingkun Chu, Hong Tang, Tao Yang, Kai Shen
SIGIR
2003
ACM
15 years 5 months ago
Evaluating different methods of estimating retrieval quality for resource selection
In a federated digital library system, it is too expensive to query every accessible library. Resource selection is the task to decide to which libraries a query should be routed....
Henrik Nottelmann, Norbert Fuhr
WEBDB
2010
Springer
178views Database» more  WEBDB 2010»
15 years 4 months ago
Using Latent-Structure to Detect Objects on the Web
An important requirement for emerging applications which aim to locate and integrate content distributed over the Web is to identify pages that are relevant for a given domain or ...
Luciano Barbosa, Juliana Freire
WWW
2009
ACM
15 years 4 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 4 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...