Sciweavers

3208 search results - page 277 / 642
» A Lower Bound for Primality
Sort
View
MOBIHOC
2001
ACM
16 years 6 months ago
A probabilistic analysis for the range assignment problem in ad hoc networks
In this paper we consider the following problem for ad hoc networks: assume that n nodes are distributed in a d-dimensional region, with 1d3, and assume that all the nodes have th...
Paolo Santi, Douglas M. Blough, Feodor S. Vainstei...
SLSFS
2005
Springer
16 years 4 days ago
Auxiliary Variational Information Maximization for Dimensionality Reduction
Abstract. Mutual Information (MI) is a long studied measure of information content, and many attempts to apply it to feature extraction and stochastic coding have been made. Howeve...
Felix V. Agakov, David Barber
COCO
2004
Springer
118views Algorithms» more  COCO 2004»
16 years 2 days ago
Towards the Classical Communication Complexity of Entanglement Distillation Protocols with Incomplete Information
Entanglement is an essential resource for quantum communication and quantum computation, similar to shared random bits in the classical world. Entanglement distillation extracts n...
Andris Ambainis, Ke Yang
ESA
2004
Springer
96views Algorithms» more  ESA 2004»
16 years 2 days ago
An Experimental Study of Random Knapsack Problems
The size of the Pareto curve for the bicriteria version of the knapsack problem is polynomial on average. This has been shown for various random input distributions. We experimenta...
René Beier, Berthold Vöcking
ESA
2004
Springer
160views Algorithms» more  ESA 2004»
16 years 2 days ago
Optimal External Memory Planar Point Enclosure
Abstract. In this paper we study the external memory planar point enclosure problem: Given N axis-parallel rectangles in the plane, construct a data structure on disk (an index) su...
Lars Arge, Vasilis Samoladas, Ke Yi