Sciweavers

932 search results - page 154 / 187
» Hierarchical graph indexing
Sort
View
ACTA
2007
92views more  ACTA 2007»
13 years 7 months ago
Solving #SAT using vertex covers
Abstract We propose an exact algorithm for counting the models of propositional formulas in conjunctive normal form (CNF). Our algorithm is based on the detection of strong backdoo...
Naomi Nishimura, Prabhakar Ragde, Stefan Szeider
IPL
2007
87views more  IPL 2007»
13 years 7 months ago
The forwarding indices of augmented cubes
For a given connected graph G of order n, a routing R in G is a set of n(n − 1) elementary paths specified for every ordered pair of vertices in G. The vertex (resp. edge) forw...
Min Xu, Jun-Ming Xu
CN
2000
109views more  CN 2000»
13 years 7 months ago
On near-uniform URL sampling
We consider the problem of sampling URLs uniformly at random from the Web. A tool for sampling URLs uniformly can be used to estimate various properties of Web pages, such as the ...
Monika Rauch Henzinger, Allan Heydon, Michael Mitz...
KDD
2009
ACM
257views Data Mining» more  KDD 2009»
14 years 2 months ago
Argo: intelligent advertising by mining a user's interest from his photo collections
In this paper, we introduce a system named Argo which provides intelligent advertising made possible from users’ photo collections. Based on the intuition that user-generated ph...
Xin-Jing Wang, Mo Yu, Lei Zhang, Rui Cai, Wei-Ying...
COMPGEOM
2004
ACM
14 years 1 months ago
A 2D kinetic triangulation with near-quadratic topological changes
Given a set of n points S in the plane, a triangulation of S is a subdivision of the convex hull into triangles whose vertices are from S. In the kinetic setting, the input point ...
Pankaj K. Agarwal, Yusu Wang, Hai Yu