Sciweavers

3096 search results - page 556 / 620
» Theory and Use of the EM Algorithm
Sort
View
CIKM
2005
Springer
14 years 2 months ago
Optimizing candidate check costs for bitmap indices
In this paper, we propose a new strategy for optimizing the placement of bin boundaries to minimize the cost of query evaluation using bitmap indices with binning. For attributes ...
Doron Rotem, Kurt Stockinger, Kesheng Wu
MOBIHOC
2004
ACM
14 years 2 months ago
On the behavior of communication links of a node in a multi-hop mobile environment
In this work, we develop an analytical framework to investigate the behavior of the communication links of a node in a random mobility environment. Analytical expressions characte...
Prince Samar, Stephen B. Wicker
APPROX
2004
Springer
121views Algorithms» more  APPROX 2004»
14 years 2 months ago
Small Pseudo-random Families of Matrices: Derandomizing Approximate Quantum Encryption
A quantum encryption scheme (also called private quantum channel, or state randomization protocol) is a one-time pad for quantum messages. If two parties share a classical random s...
Andris Ambainis, Adam Smith
UPP
2004
Springer
14 years 2 months ago
Design, Simulation, and Experimental Demonstration of Self-assembled DNA Nanostructures and Motors
Self-assembly is the spontaneous self-ordering of substructures into superstructures driven by the selective affinity of the substructures. DNA provides a molecular scale material...
John H. Reif, Thomas H. LaBean, Sudheer Sahu, Hao ...
INFOCOM
2003
IEEE
14 years 2 months ago
Cooperation in Wireless Ad Hoc Networks
— In wireless ad hoc networks, nodes communicate with far off destinations using intermediate nodes as relays. Since wireless nodes are energy constrained, it may not be in the b...
Vikram Srinivasan, Pavan Nuggehalli, Carla-Fabiana...