92 search results - page 10 / 19 » Generating Shorter Bases for Hard Random Lattices |
APPROX
2009
Springer
15 years 6 months ago
2009
Springer
The area of derandomization attempts to provide efficient deterministic simulations of randomized algorithms in various algorithmic settings. Goldreich and Wigderson introduced a n...
JCB
1998
14 years 11 months ago
1998
Abstract. The method of invariants is an approach to the problem of reconstructing the phylogenetic tree of a collection of m taxa using nucleotide sequence data. Models for the re...
DCC
2001
IEEE
15 years 11 months ago
2001
IEEE
We consider the problem of compressing graphs of the link structure of the World Wide Web. We provide efficient algorithms for such compression that are motivated by recently prop...
SPEECH
2008
14 years 11 months ago
2008
The ever-increasing volume of audio data available online through the world wide web means that automatic methods for indexing and search are becoming essential. Hidden Markov mod...
106
click to vote
EMSOFT
2008
Springer
15 years 1 months ago
2008
Springer
The Simulink/Stateflow (SL/SF) environment from Mathworks is becoming the de facto standard in industry for model based development of embedded control systems. Many commercial to...