Sciweavers

1951 search results - page 90 / 391
» An algorithm for improving graph partitions
Sort
View
IPPS
2007
IEEE
15 years 10 months ago
Decomposing Partial Order Execution Graphs to Improve Message Race Detection
In message-passing parallel applications, messages are not delivered in a strict order. In most applications, the computation results and the set of messages produced during the e...
Basile Schaeli, Sebastian Gerlach, Roger D. Hersch
CIKM
2009
Springer
15 years 11 months ago
Improving web page classification by label-propagation over click graphs
In this paper, we present a semi-supervised learning method for web page classification, leveraging click logs to augment training data by propagating class labels to unlabeled si...
Soo-Min Kim, Patrick Pantel, Lei Duan, Scott Gaffn...
ECCV
1994
Springer
16 years 6 months ago
On the Enumerative Geometry of Aspect Graphs
Most of the work achieved thus far on aspect graphs has concentrated on the design of algorithms for computing the representation. After reviewing how the space of viewpoints can b...
Sylvain Petitjean
DASFAA
2009
IEEE
173views Database» more  DASFAA 2009»
15 years 8 months ago
A Uniform Framework for Ad-Hoc Indexes to Answer Reachability Queries on Large Graphs
Graph-structured databases and related problems such as reachability query processing have been increasingly relevant to many applications such as XML databases, biological databas...
Linhong Zhu, Byron Choi, Bingsheng He, Jeffrey Xu ...
PVLDB
2008
108views more  PVLDB 2008»
15 years 3 months ago
Taming verification hardness: an efficient algorithm for testing subgraph isomorphism
Graphs are widely used to model complicated data semantics in many applications. In this paper, we aim to develop efficient techniques to retrieve graphs, containing a given query...
Haichuan Shang, Ying Zhang, Xuemin Lin, Jeffrey Xu...