2492 search results - page 266 / 499 » On the General Signature Trees |
176
click to vote
FOCS
2005
IEEE
16 years 9 days ago
2005
IEEE
We prove the first non-trivial (super linear) lower bound in the noisy broadcast model, defined by El Gamal in [6]. In this model there are n + 1 processors P0, P1, . . . , Pn, ...
174
Voted
WWW
2005
ACM
16 years 7 months ago
2005
ACM
In this paper, we propose a framework, called XAR-Miner, for mining ARs from XML documents efficiently. In XAR-Miner, raw data in the XML document are first preprocessed to transf...
168
click to vote
WADS
2007
Springer
16 years 24 days ago
2007
Springer
Let G = (S, E) be a plane straight-line graph on a finite point set S ⊂ R2 in general position. The incident angles of a point p ∈ S in G are the angles between any two edges ...
173
click to vote
CIG
2006
IEEE
16 years 23 days ago
2006
IEEE
The Voronoi game is a two-person game which is a model for a competitive facility location. The game is done on a continuous domain, and only two special cases (1-dimensional case ...
168
click to vote
SMA
2003
ACM
15 years 12 months ago
2003
ACM
This paper has two parts. First, we propose a method which can be used to decompose a geometric constraint graph into a c-tree. With this decomposition, solving for a well-constrai...