Sciweavers

2095 search results - page 314 / 419
» Improved pebbling bounds
Sort
View
FOCS
2009
IEEE
14 years 4 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
GLVLSI
2009
IEEE
122views VLSI» more  GLVLSI 2009»
14 years 4 months ago
Enhancing SAT-based sequential depth computation by pruning search space
The sequential depth determines the completeness of bounded model checking in design verification. Recently, a SATbased method is proposed to compute the sequential depth of a de...
Yung-Chih Chen, Chun-Yao Wang
ICASSP
2009
IEEE
14 years 4 months ago
A framework for distributed multimedia stream mining systems using coalition-based foresighted strategies
In this paper, we propose a distributed solution to the problem of configuring classifier trees in distributed stream mining systems. The configuration involves selecting appro...
Hyunggon Park, Deepak S. Turaga, Olivier Verscheur...
ICC
2009
IEEE
14 years 4 months ago
Robust Cyclic Space-Frequency Filtering for BICM-OFDM with Outdated CSIT
— In this paper, we introduce robust cyclic space– frequency (CSF) filtering for systems combining bit–interleaved coded modulation (BICM) and orthogonal frequency division ...
Harry Z. B. Chen, Robert Schober, Wolfgang H. Gers...
RTAS
2009
IEEE
14 years 4 months ago
Execution Strategies for PTIDES, a Programming Model for Distributed Embedded Systems
—We define a family of execution policies for a programming model called PTIDES (Programming Temporally Integrated Distributed Embedded Systems). A PTIDES application (factory a...
Jia Zou, Slobodan Matic, Edward A. Lee, Thomas Hui...