1677 search results - page 320 / 336 » On the Completeness of Quantum Computation Models |
ISTCS
1997
Springer
15 years 3 months ago
1997
Springer
We introduce the k-payment problem: given a total budget of N units, the problem is to represent this budget as a set of coins, so that any k exact payments of total value at most ...
111
click to vote
SPDP
1993
IEEE
15 years 3 months ago
1993
IEEE
We consider the problem of transforming a given sequential implementation of a data structure into a wait-free concurrent implementation. Given the code for different operations ...
RTA
2010
Springer
15 years 3 months ago
2010
Springer
Data words and data trees appear in verification and XML processing. The term “data” means that positions of the word, or tree, are decorated with elements of an infinite set...
100
click to vote
DCOSS
2006
Springer
15 years 3 months ago
2006
Springer
We consider in-network processing via local message passing. The considered setting involves a set of sensors each of which can communicate with a subset of other sensors. There is...
119
click to vote
ICCV
1995
IEEE
15 years 3 months ago
1995
IEEE
A new approach to tracking weakly modeled objects in a semantically rich domain is presented. We define a closed-world as a space-time region of an image sequence in which the co...