Sciweavers

5144 search results - page 751 / 1029
» Enhancing Search with Structure
Sort
View
OOPSLA
2005
Springer
16 years 4 days ago
Lifting sequential graph algorithms for distributed-memory parallel computation
This paper describes the process used to extend the Boost Graph Library (BGL) for parallel operation with distributed memory. The BGL consists of a rich set of generic graph algor...
Douglas Gregor, Andrew Lumsdaine
PKDD
2005
Springer
131views Data Mining» more  PKDD 2005»
16 years 4 days ago
ISOLLE: Locally Linear Embedding with Geodesic Distance
Locally Linear Embedding (LLE) has recently been proposed as a method for dimensional reduction of high-dimensional nonlinear data sets. In LLE each data point is reconstructed fro...
Claudio Varini, Andreas Degenhard, Tim W. Nattkemp...
WEBDB
2005
Springer
129views Database» more  WEBDB 2005»
16 years 4 days ago
Processing Top-N Queries in P2P-based Web Integration Systems with Probabilistic Guarantees
Efficient query processing in P2P-based Web integration systems poses a variety of challenges resulting from the strict decentralization and limited knowledge. As a special probl...
Katja Hose, Marcel Karnstedt, Kai-Uwe Sattler, Dan...
SIGIR
2004
ACM
16 years 2 days ago
Effectiveness of web page classification on finding list answers
List question answering (QA) offers a unique challenge in effectively and efficiently locating a complete set of distinct answers from huge corpora or the Web. In TREC-12, the med...
Hui Yang, Tat-Seng Chua
APN
2004
Springer
16 years 2 days ago
Reachability Set Generation for Petri Nets: Can Brute Force Be Smart?
Generating the reachability set is one of the most commonly required step when analyzing the logical or stochastic behavior of a system modeled with Petri nets. Traditional “expl...
Gianfranco Ciardo