Sciweavers

4377 search results - page 46 / 876
» Mass problems and randomness
Sort
View
STOC
2001
ACM
97views Algorithms» more  STOC 2001»
16 years 6 months ago
Sharp threshold and scaling window for the integer partitioning problem
We consider the problem of partitioning n integers chosen randomly between 1 and 2m into two subsets such that the discrepancy, the absolute value of the difference of their sums,...
Christian Borgs, Jennifer T. Chayes, Boris Pittel
CPAIOR
2007
Springer
16 years 9 days ago
Preprocessing Expression-Based Constraint Satisfaction Problems for Stochastic Local Search
Abstract. This work presents methods for processing a constraint satisfaction problem (CSP) formulated by an expression-based language, before the CSP is presented to a stochastic ...
Sivan Sabato, Yehuda Naveh
SLS
2007
Springer
117views Algorithms» more  SLS 2007»
16 years 8 days ago
An Algorithm Portfolio for the Sub-graph Isomorphism Problem
Abstract. This work presents an algorithm for the sub-graph isomorphism problem based on a new pruning technique for directed graphs. During the tree search, the method checks if a...
Roberto Battiti, Franco Mascia
COMPGEOM
1997
ACM
15 years 10 months ago
Time-Series Similarity Problems and Well-Separated Geometric Sets
Given a pair of nonidentical complex objects, de ning and determining how similar they are to each other is a nontrivial problem. In data mining applications, one frequently nee...
Béla Bollobás, Gautam Das, Dimitrios...
CRYPTO
2007
Springer
130views Cryptology» more  CRYPTO 2007»
16 years 9 days ago
A Security Analysis of the NIST SP 800-90 Elliptic Curve Random Number Generator
An elliptic curve random number generator (ECRNG) has been approved in a NIST standards and proposed for ANSI and SECG draft standards. This paper proves that, if three conjecture...
Daniel R. L. Brown, Kristian Gjøsteen