10988 search results - page 1979 / 2198 » Algorithmic Folding Complexity |
140
click to vote
SPIRE
2010
Springer
15 years 2 months ago
2010
Springer
We initiate the study of the smoothed complexity of the Closest String problem by proposing a semi-random model of Hamming distance. We restrict interest to the optimization versio...
131
click to vote
SSS
2010
Springer
15 years 2 months ago
2010
Springer
In this paper we present new distributed protocols to color even rings and general bipartite graphs. Our motivation is to provide algorithmic explanation for human subject experime...
141
click to vote
TPDS
2010
15 years 2 months ago
2010
—We propose FIT, a flexible, lightweight, and real-time scheduling system for wireless sensor platforms. There are three salient features of FIT. First, its two-tier hierarchical...
131
click to vote
TVCG
2010
15 years 2 months ago
2010
As data sources become larger and more complex, the ability to effectively explore and analyze patterns amongst varying sources becomes a critical bottleneck in analytic reasoning...
154
click to vote
VLSI
2010
Springer
15 years 2 months ago
2010
Springer
—In this paper, we introduce a design methodology to implement low-complexity and high-speed digital Finite Impulse Response (FIR) filters. Since FIR filters suffer from a larg...