5 search results - page 1 / 1 » Tight Bounds for Blind Search on the Integers |
CORR
2008
Springer
13 years 5 months ago
2008
Springer
We analyze a simple random process in which a token is moved in the interval A = {0, . . . , n}: Fix a probability distribution
FPGA
1999
ACM
13 years 9 months ago
1999
ACM
Multi-FPGA systems are used as custom computing machines to solve compute intensive problems and also in the verification and prototyping of large circuits. In this paper, we addr...
CPAIOR
2010
Springer
13 years 8 months ago
2010
Springer
Cutting plane methods are widely used for solving convex optimization problems and are of fundamental importance, e.g., to provide tight bounds for Mixed-Integer Programs (MIPs). T...
COMGEO
2004
ACM
13 years 4 months ago
2004
ACM
In k-means clustering we are given a set of n data points in d-dimensional space d and an integer k, and the problem is to determine a set of k points in d , called centers, to mi...
STOC
2012
ACM
11 years 7 months ago
2012
ACM
In this paper we develop a new technique for proving lower bounds on the update time and query time of dynamic data structures in the cell probe model. With this technique, we pro...