2434 search results - page 162 / 487 » Algorithmic Randomness of Closed Sets |
136
click to vote
NETWORKS
2010
15 years 2 months ago
2010
Let G = (V, E, Q) be a undirected graph, where V is the set of vertices, E is the set of edges, and Q = {Q1, . . . , Qq} is a partition of V into q subsets. We refer to Q1, . . . ...
144
click to vote
ICCV
2009
IEEE
16 years 8 months ago
2009
IEEE
We propose a polynomial-time algorithm for segmentation
and (open) boundary estimation which takes into account
a series of user-specified attraction points. In contrast
to exis...
127
click to vote
IPPS
2006
IEEE
15 years 9 months ago
2006
IEEE
This paper describes a parallel implementation of our recently developed algorithm for phylogenetic analysis on the IBM BlueGene/L cluster [15]. This algorithm constructs evolutio...
129
click to vote
SIGGRAPH
1992
ACM
15 years 7 months ago
1992
ACM
We present a new radiosi[y algorithm for efficiently computing global solutions with respect to a constrained set of views. Radiosi ties of directly visible surfaces are computed ...
124
click to vote
CADE
2009
Springer
15 years 10 months ago
2009
Springer
predicate abstraction Shuvendu K. Lahiri and Shaz Qadeer Microsoft Research In this paper, we investigate the asymptotic complexity of various predicate abstraction problems relati...