Sciweavers

1677 search results - page 44 / 336
» On the Completeness of Quantum Computation Models
Sort
View
PODS
2009
ACM
113views Database» more  PODS 2009»
16 years 2 months ago
Relative information completeness
The paper investigates the question of whether a partially closed database has complete information to answer a query. In practice an enterprise often maintains master data Dm, a ...
Wenfei Fan, Floris Geerts
SIAMMAX
2010
164views more  SIAMMAX 2010»
14 years 8 months ago
Uniqueness of Low-Rank Matrix Completion by Rigidity Theory
The problem of completing a low-rank matrix from a subset of its entries is often encountered in the analysis of incomplete data sets exhibiting an underlying factor model with app...
Amit Singer, Mihai Cucuringu
JACM
2002
107views more  JACM 2002»
15 years 1 months ago
Paradoxes in distributed decisions on optimal load balancing for networks of homogeneous computers
In completely symmetric systems that have homogeneous nodes (hosts, computers, or processors) with identical arrival processes, an optimal static load balancing scheme does not in...
Hisao Kameda, Odile Pourtallier
CORR
2007
Springer
100views Education» more  CORR 2007»
15 years 1 months ago
Interference Automata
We propose a computing model, the Two-Way Optical Interference Automata (2OIA), that makes use of the phenomenon of optical interference. We introduce this model to investigate th...
M. V. Panduranga Rao
UC
2005
Springer
15 years 7 months ago
On Model-Checking of P Systems
Abstract. Membrane computing is a branch of molecular computing that aims to develop models and paradigms that are biologically motivated. It identifies an unconventional computin...
Zhe Dang, Oscar H. Ibarra, Cheng Li, Gaoyan Xie