340 search results - page 3 / 68 » A New Algorithm for the Construction of Optimal B-Trees |
SPAA
1993
ACM
13 years 11 months ago
1993
ACM
We give tight bounds on the parallel complexity of some problems involving random graphs. Speci cally, we show that a Hamiltonian cycle, a breadth rst spanning tree, and a maximal...
WSC
2008
13 years 10 months ago
2008
We introduce a new approach, called Relative Start and Idle Time (RSIT), to solve probabilistic scheduling problems of construction repetitive projects. RSIT is a process of deter...
ASIACRYPT
2004
Springer
14 years 1 months ago
2004
Springer
We study the class of masking based domain extenders for UOWHFs. Our first contribution is to show that any correct masking based domain extender for UOWHF which invokes the compr...
UAI
2004
13 years 9 months ago
2004
We present a new method for nonlinear prediction of discrete random sequences under minimal structural assumptions. We give a mathematical construction for optimal predictors of s...
ICCAD
2002
IEEE
14 years 16 days ago
2002
IEEE
Shrinking process geometries and the increasing use of IP components in SoC designs give rise to new problems in routing and buffer insertion. A particular concern is that cross-c...