9842 search results - page 1388 / 1969 » The Complexity of the Matching-Cut Problem |
199
click to vote
RT
2004
Springer
16 years 16 days ago
2004
Springer
This paper proposes a new shadow map technique termed trapezoidal shadow maps to calculate high quality shadows in real-time applications. To address the resolution problem of the...
163
click to vote
WG
2004
Springer
16 years 16 days ago
2004
Springer
The Phylogenetic kth Root Problem (PRk) is the problem of finding a (phylogenetic) tree T from a given graph G = (V, E) such that (1) T has no degree-2 internal nodes, (2) the ex...
176
click to vote
FOCS
2003
IEEE
16 years 14 days ago
2003
IEEE
: Can Grover’s algorithm speed up search of a physical region—for example a 2-D grid of size √ n × √ n? The problem is that √ n time seems to be needed for each query, j...
155
click to vote
ICRA
2003
IEEE
16 years 14 days ago
2003
IEEE
Abstract— This paper addresses the problem of capturing an arbitrary convex object P in the plane with three congruent disc-shaped robots. Given two stationary robots in contact ...
266
click to vote
ICTAI
2003
IEEE
16 years 14 days ago
2003
IEEE
Computing and storing probabilities is a hard problem as soon as one has to deal with complex distributions over multiples random variables. The problem of efficient representati...