2553 search results - page 157 / 511 » Modeling Trees with Hypertextures |
165
click to vote
QEST
2008
IEEE
16 years 27 days ago
2008
IEEE
We begin by observing that (discrete-time) QuasiBirth-Death Processes (QBDs) are equivalent, in a precise sense, to (discrete-time) probabilistic 1-Counter Automata (p1CAs), and b...
148
click to vote
SMA
2003
ACM
15 years 11 months ago
2003
ACM
This paper presents a new method to compute constructive solid geometry (CSG) tree representations of an object whose faces consist of planar and non-planar surfaces. The algorith...
175
click to vote
COLING
1996
15 years 7 months ago
1996
This paper studies the computational complexity of disambiguation under probabilistic tree-grammars as in (Bod, 1992; Schabes and Waters, 1993). It presents a proof that the follo...
131
click to vote
WWW
2001
ACM
16 years 7 months ago
2001
ACM
Many emerging web and Internet applications are based on a group communications model. Thus, securing group communications is an important Internet design issue. The key graph app...
146
click to vote
ISLPED
2006
ACM
16 years 15 days ago
2006
ACM
This paper addresses the problem of low-power fanout optimization. We show that due to neglecting short-circuit current, previous analytical techniques proposed to optimize the ar...