Sciweavers

1871 search results - page 70 / 375
» The Ephemeral Pairing Problem
Sort
View
ISCA
2006
IEEE
120views Hardware» more  ISCA 2006»
15 years 5 months ago
Interconnection Networks for Scalable Quantum Computers
We show that the problem of communication in a quantum computer reduces to constructing reliable quantum channels by distributing high-fidelity EPR pairs. We develop analytical m...
Nemanja Isailovic, Yatish Patel, Mark Whitney, Joh...
DAGM
2004
Springer
15 years 4 months ago
A Probabilistic Framework for Robust and Accurate Matching of Point Clouds
We present a probabilistic framework for matching of point clouds. Variants of the ICP algorithm typically pair points to points or points to lines. Instead, we pair data points to...
Peter Biber, Sven Fleck, Wolfgang Straßer
IPPS
1999
IEEE
15 years 3 months ago
A Parallel Algorithm for Bound-Smoothing
Determining molecular structure from interatomic distances is an important and challenging problem. Given a molecule with n atoms, lower and upper bounds on interatomic distances ...
Kumar Rajan, Narsingh Deo
RIVF
2007
15 years 18 days ago
Disambiguation of People in Web Search Using a Knowledge Base
— Results of queries by personal names often contain documents related to several people because of the namesake problem. In order to differentiate documents related to different...
Quang Minh Vu, Tomonari Masada, Atsuhiro Takasu, J...
AUTOMATICA
2007
62views more  AUTOMATICA 2007»
14 years 11 months ago
Further results on structural assignment of linear systems via sensor selection
The problem of assigning structural properties of a linear system through sensor selection is, for a given pair (A, B), to find an output pair (C, D) such that the resulting syst...
Xinmin Liu, Zongli Lin, Ben M. Chen