Sciweavers

5100 search results - page 794 / 1020
» The Linear Complexity of a Graph
Sort
View
ICML
2007
IEEE
16 years 7 months ago
Efficient inference with cardinality-based clique potentials
Many collective labeling tasks require inference on graphical models where the clique potentials depend only on the number of nodes that get a particular label. We design efficien...
Rahul Gupta, Ajit A. Diwan, Sunita Sarawagi
ICDT
2009
ACM
105views Database» more  ICDT 2009»
16 years 7 months ago
Efficient data structures for range-aggregate queries on trees
Graph-theoretic aggregation problems have been considered both in OLAP (grid graph) and XML (tree). This paper gives new results for MIN aggregation in a tree, where we want the M...
Hao Yuan, Mikhail J. Atallah
WWW
2008
ACM
16 years 7 months ago
Personalized view-based search and visualization as a means for deep/semantic web data access
Effective access to and navigation in information stored in deep Web ontological repositories or relational databases has yet to be realized due to issues with usability of user i...
Mária Bieliková, Michal Tvarozek
WWW
2004
ACM
16 years 7 months ago
The effect of the back button in a random walk: application for pagerank
Theoretical analysis of the Web graph is often used to improve the efficiency of search engines. The PageRank algorithm, proposed by [5], is used by the Google search engine [4] t...
Fabien Mathieu, Mohamed Bouklit
STOC
2009
ACM
123views Algorithms» more  STOC 2009»
16 years 7 months ago
An improved constant-time approximation algorithm for maximum~matchings
This paper studies constant-time approximation algorithms for problems on degree-bounded graphs. Let n and d be the number of vertices and the degree bound, respectively. This pap...
Yuichi Yoshida, Masaki Yamamoto, Hiro Ito