1380 search results - page 209 / 276 » A General Polynomial Sieve |
138
click to vote
COMPGEOM
1995
ACM
15 years 9 months ago
1995
ACM
Abstract. We show that there is a matching between the edges of any two triangulations of a planar point set such that an edge of one triangulation is matched either to the identic...
136
click to vote
WG
2000
Springer
15 years 9 months ago
2000
Springer
: In a previous work, the authors introduced the class of graphs with bounded induced distance of order k, (BID(k) for short) to model non-reliable interconnection networks. A netw...
164
click to vote
ICDT
1995
ACM
15 years 9 months ago
1995
ACM
Following results are sketched in this extended abstract: (1) Datalog recursive programs where each rule has at most one subgoal called unit recursions are shown to be bounded, wit...
177
click to vote
INFOCOM
1995
IEEE
15 years 9 months ago
1995
IEEE
In communication networks, a large number of alarms exist to signal any abnormal behavior of the network. As network faults typically result in a number of alarms, correlating the...
142
click to vote
SIGGRAPH
1995
ACM
15 years 9 months ago
1995
ACM
We present new techniques for computing illumination from non-diffuse luminaires and scattering from non-diffuse surfaces. The methods are based on new closed-form expressions d...