Sciweavers

1089 search results - page 50 / 218
» Randomness and Reducibility
Sort
View
MSS
2000
IEEE
81views Hardware» more  MSS 2000»
14 years 1 months ago
Compact Holographic Read/Write Memory
— We examine the primary challenges for building a practical and competitive holographic random access memory (HRAM) system, specifically size, speed, and cost. We show that a fa...
Wenhai Liu, Demetri Psaltis
CP
2000
Springer
14 years 1 months ago
Singleton Consistencies
We perform a comprehensive theoretical and empirical study of the benefits of singleton consistencies. Our theoretical results help place singleton consistencies within the hierar...
Patrick Prosser, Kostas Stergiou, Toby Walsh
FOCS
1993
IEEE
14 years 1 months ago
Simulated Annealing for Graph Bisection
We resolve in the a rmative a question of Boppana and Bui: whether simulated annealing can, with high probability and in polynomial time, nd the optimal bisection of a random grap...
Mark Jerrum, Gregory B. Sorkin
EDBT
2010
ACM
132views Database» more  EDBT 2010»
14 years 10 days ago
Turbo-charging hidden database samplers with overflowing queries and skew reduction
Recently, there has been growing interest in random sampling from online hidden databases. These databases reside behind form-like web interfaces which allow users to execute sear...
Arjun Dasgupta, Nan Zhang 0004, Gautam Das
CCGRID
2010
IEEE
13 years 10 months ago
Dynamic TTL-Based Search in Unstructured Peer-to-Peer Networks
Abstract--Resource discovery is a challenging issue in unstructured peer-to-peer networks. Blind search approaches, including flooding and random walks, are the two typical algorit...
Imen Filali, Fabrice Huet