2168 search results - page 142 / 434 » Randomized Algorithms and Complexity Theory |
176
click to vote
COLT
2001
Springer
15 years 8 months ago
2001
Springer
We prove strong noise-tolerance properties of a potential-based boosting algorithm, similar to MadaBoost (Domingo and Watanabe, 2000) and SmoothBoost (Servedio, 2003). Our analysi...
128
click to vote
ASPDAC
2009
ACM
15 years 10 months ago
2009
ACM
— Power distribution networks (PDNs) are designed and analyzed iteratively. Random walk is among the most efficient methods for PDN analysis. We develop in this paper an increme...
153
Voted
NOSSDAV
2009
Springer
15 years 10 months ago
2009
Springer
In multi-hop wireless networks, random network coding represents the general design principle of transmitting random linear combinations of blocks in the same “batch” to downs...
135
click to vote
BMCBI
2005
15 years 3 months ago
2005
Background: The inference of homology from statistically significant sequence similarity is a central issue in sequence alignments. So far the statistical distribution function un...
145
click to vote
ATAL
2007
Springer
15 years 9 months ago
2007
Springer
Activity recognition is a key component for creating intelligent, multi-agent systems. Intrinsically, activity recognition is a temporal classification problem. In this paper, we...