Sciweavers

530 search results - page 28 / 106
» Universal randomized switching
Sort
View
130
Voted
STOC
1998
ACM
96views Algorithms» more  STOC 1998»
15 years 8 months ago
Randomized Protocols for Low Congestion Circuit Routing in Multistage Interconnection Networks
In this paper we study randomized algorithms for circuit switching on multistage networks related to the butterfly. We devise algorithms that route messages by constructing circu...
Richard Cole, Bruce M. Maggs, Friedhelm Meyer auf ...
115
Voted
CORR
2010
Springer
103views Education» more  CORR 2010»
15 years 3 months ago
Asymptotic Learning Curve and Renormalizable Condition in Statistical Learning Theory
Bayes statistics and statistical physics have the common mathematical structure, where the log likelihood function corresponds to the random Hamiltonian. Recently, it was discovere...
Sumio Watanabe
114
Voted
AMC
2007
91views more  AMC 2007»
15 years 3 months ago
Deterministic and random synthesis of discrete chaos
In this paper, two anticontrol algorithms for synthesis of discrete chaos are introduced. In these algorithms, the control parameter of a discrete dynamical system is switched, ei...
Miguel Romera, Michael Small, Marius-F. Danca
AVSS
2006
IEEE
15 years 9 months ago
A Random Field Model for Improved Feature Extraction and Tracking
This paper presents a novel method for illuminationinvariant and contrast preserving feature extraction, aimed at improving performance of tracking under complex light condition. ...
Xiaotong Yuan, Stan Z. Li
174
Voted
ALGOSENSORS
2009
Springer
15 years 1 months ago
Brief Announcement: Universal Data Aggregation Trees for Sensor Networks in Low Doubling Metrics
Abstract. We describe a novel approach for constructing a single spanning tree for data aggregation towards a sink node. The tree is universal in the sense that it is static and in...
Srinivasagopalan Srivathsan, Costas Busch, S. Sith...