224 search results - page 38 / 45 » G-graphs for the cage problem: a new upper bound |
145
click to vote
EPEW
2006
Springer
15 years 9 months ago
2006
Springer
Abstract. Recently, there is an explosive development of fluid approaches to computer and distributed systems. These approaches are inherently stochastic and generate continuous st...
156
click to vote
QEST
2008
IEEE
16 years 13 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...
145
click to vote
COMPGEOM
2007
ACM
15 years 10 months ago
2007
ACM
We consider the problem of placing a small number of angle guards inside a simple polygon P so as to provide efficient proofs that any given point is inside P. Each angle guard vi...
208
click to vote
LICS
1991
IEEE
15 years 9 months ago
1991
IEEE
d Abstract) Maria Luisa Bonet∗ Samuel R. Buss∗ Department of Mathematics Department of Mathematics U.C. Berkeley U.C. San Diego Berkeley, California 94720 La Jolla, California ...
150
click to vote
ICPR
2004
IEEE
16 years 7 months ago
2004
IEEE
In a previous paper [1], we have presented a new linear classification algorithm, Principal Component Null Space Analysis (PCNSA) which is designed for problems like object recogn...