Sciweavers

619 search results - page 42 / 124
» Random Bichromatic Matchings
Sort
View
ESA
2004
Springer
96views Algorithms» more  ESA 2004»
14 years 2 months 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
VLDB
2007
ACM
102views Database» more  VLDB 2007»
14 years 9 months ago
Randomized Algorithms for Data Reconciliation in Wide Area Aggregate Query Processing
Many aspects of the data integration problem have been considered in the literature: how to match schemas across different data sources, how to decide when different records refer...
Fei Xu, Chris Jermaine
CRYPTO
2009
Springer
87views Cryptology» more  CRYPTO 2009»
14 years 3 months ago
Reconstructing RSA Private Keys from Random Key Bits
sion of an extended abstract published in Proceedings of Crypto 2009, Springer-Verlag, 2009. Available from the IACR Cryptology ePrint Archive as Report 2008/510. We show that an ...
Nadia Heninger, Hovav Shacham
IDA
2009
Springer
14 years 3 months ago
Estimating Markov Random Field Potentials for Natural Images
Markov Random Field (MRF) models with potentials learned from the data have recently received attention for learning the low-level structure of natural images. A MRF provides a pri...
Urs Köster, Jussi T. Lindgren, Aapo Hyvä...
FOCS
2003
IEEE
14 years 2 months ago
Switch Scheduling via Randomized Edge Coloring
The essence of an Internet router is an n ¡ n switch which routes packets from input to output ports. Such a switch can be viewed as a bipartite graph with the input and output p...
Gagan Aggarwal, Rajeev Motwani, Devavrat Shah, An ...