Sciweavers

91 search results - page 16 / 19
» On random points in the unit disk
Sort
View
VLDB
2004
ACM
163views Database» more  VLDB 2004»
15 years 2 months ago
Compressing Large Boolean Matrices using Reordering Techniques
Large boolean matrices are a basic representational unit in a variety of applications, with some notable examples being interactive visualization systems, mining large graph struc...
David S. Johnson, Shankar Krishnan, Jatin Chhugani...
108
Voted
HOTOS
1993
IEEE
15 years 1 months ago
Object Groups May Be Better Than Pages
I argue against trying to solve the problem of clustering objects into disk pages. Instead, I propose that objects be fetched in groups that may be specific to an application or ...
Mark Day
ICDE
2011
IEEE
235views Database» more  ICDE 2011»
14 years 1 months ago
Dealing proactively with data corruption: Challenges and opportunities
—The danger of production or backup data becoming corrupted is a problem that database administrators dread. This position paper aims to bring this problem to the attention of th...
Nedyalko Borisov, Shivnath Babu, NagaPramod Mandag...
COMPGEOM
1992
ACM
15 years 1 months ago
A Subexponential Bound for Linear Programming
We present a simple randomized algorithm which solves linear programs with n constraints and d variables in expected minfO(d 22dn); e 2 pdln(n= p d)+O( p d+lnn)g time in the unit ...
Jirí Matousek, Micha Sharir, Emo Welzl
80
Voted
STOC
2007
ACM
100views Algorithms» more  STOC 2007»
15 years 9 months ago
Reordering buffers for general metric spaces
In the reordering buffer problem, we are given an input sequence of requests for service each of which corresponds to a point in a metric space. The cost of serving the requests h...
Matthias Englert, Harald Räcke, Matthias West...