Sciweavers

1933 search results - page 334 / 387
» Improved Algorithms for the Feedback Vertex Set Problems
Sort
View
FOCS
2009
IEEE
14 years 2 months ago
Faster Generation of Random Spanning Trees
In this paper, we set forth a new algorithm for generating approximately uniformly random spanning trees in undirected graphs. We show how to sample from a distribution that is wi...
Jonathan A. Kelner, Aleksander Madry
FMCAD
2009
Springer
14 years 2 months ago
Scaling VLSI design debugging with interpolation
—Given an erroneous design, functional verification returns an error trace exhibiting a mismatch between the specification and the implementation of a design. Automated design ...
Brian Keng, Andreas G. Veneris
IWOCA
2009
Springer
149views Algorithms» more  IWOCA 2009»
14 years 2 months ago
Randomized Postoptimization of Covering Arrays
The construction of covering arrays with the fewest rows remains a challenging problem. Most computational and recursive constructions result in extensive repetition of coverage. W...
Peyman Nayeri, Charles J. Colbourn, Goran Konjevod
ICDCS
2008
IEEE
14 years 2 months ago
Hotness-Aware Sensor Networks
In a realistic sensor network, in particular with a nonuniform deployment, sensor nodes inevitably have varying workloads. This causes a natural problem that some sensor nodes are...
Dong Li, Yanmin Zhu, Li Cui, Lionel M. Ni
VLDB
2007
ACM
105views Database» more  VLDB 2007»
14 years 1 months ago
Extending Q-Grams to Estimate Selectivity of String Matching with Low Edit Distance
There are many emerging database applications that require accurate selectivity estimation of approximate string matching queries. Edit distance is one of the most commonly used s...
Hongrae Lee, Raymond T. Ng, Kyuseok Shim