Sciweavers

2403 search results - page 425 / 481
» Optimal Randomized RANSAC
Sort
View
CORR
2011
Springer
198views Education» more  CORR 2011»
14 years 4 months ago
Pattern matching in Lempel-Ziv compressed strings: fast, simple, and deterministic
Countless variants of the Lempel-Ziv compression are widely used in many real-life applications. This paper is concerned with a natural modification of the classical pattern match...
Pawel Gawrychowski
CORR
2010
Springer
108views Education» more  CORR 2010»
14 years 4 months ago
Finding Cycles and Trees in Sublinear Time
We present sublinear-time (randomized) algorithms for finding simple cycles of length at least k 3 and tree-minors in bounded-degree graphs. The complexity of these algorithms is...
Artur Czumaj, Oded Goldreich, Dana Ron, C. Seshadh...
JSAC
2011
159views more  JSAC 2011»
14 years 4 months ago
An Anti-Jamming Stochastic Game for Cognitive Radio Networks
—Various spectrum management schemes have been proposed in recent years to improve the spectrum utilization in cognitive radio networks. However, few of them have considered the ...
Beibei Wang, Yongle Wu, K. J. Ray Liu, T. Charles ...
NECO
2011
14 years 4 months ago
Least-Squares Independent Component Analysis
Accurately evaluating statistical independence among random variables is a key element of Independent Component Analysis (ICA). In this paper, we employ a squared-loss variant of ...
Taiji Suzuki, Masashi Sugiyama
TNN
2011
129views more  TNN 2011»
14 years 4 months ago
Minimum Complexity Echo State Network
—Reservoir computing (RC) refers to a new class of state-space models with a fixed state transition structure (the “reservoir”) and an adaptable readout form the state space...
Ali Rodan, Peter Tino