1090 search results - page 146 / 218 » Priority Algorithms for Graph Optimization Problems |
CIKM
2011
Springer
12 years 7 months ago
2011
Springer
A fundamental problem related to RDF query processing is selectivity estimation, which is crucial to query optimization for determining a join order of RDF triple patterns. In thi...
SPAA
2003
ACM
14 years 29 days ago
2003
ACM
We consider an online version of the oblivious routing problem. Oblivious routing is the problem of picking a routing between each pair of nodes (or a set of ows), without knowled...
JACM
2006
13 years 7 months ago
2006
In this article, we study the problem of online market clearing where there is one commodity in the market being bought and sold by multiple buyers and sellers whose bids arrive an...
ICCAD
1999
IEEE
14 years 22 hour ago
1999
IEEE
In this paper we present new methods for fast justification and propagation in the implication graph (IG) which is the core data structure of our SAT based implication engine. As ...
WWW
2010
ACM
14 years 2 months ago
2010
ACM
Detecting clusters or communities in large real-world graphs such as large social or information networks is a problem of considerable interest. In practice, one typically chooses...