Sciweavers

19320 search results - page 238 / 3864
» On the complexity of computing determinants
Sort
View
CORR
2011
Springer
188views Education» more  CORR 2011»
15 years 1 months ago
On the Decoding Complexity of Cyclic Codes Up to the BCH Bound
—The standard algebraic decoding algorithm of cyclic codes [n, k, d] up to the BCH bound t is very efficient and practical for relatively small n while it becomes unpractical fo...
Davide Schipani, Michele Elia, Joachim Rosenthal
DAC
2006
ACM
16 years 7 months ago
Systematic temperature sensor allocation and placement for microprocessors
Modern high performance processors employ advanced techniques for thermal management, which rely on accurate readings of on-die thermal sensors. As the importance of thermal effec...
Rajarshi Mukherjee, Seda Ogrenci Memik
LICS
2009
IEEE
16 years 1 months ago
An Improved Lower Bound for the Complementation of Rabin Automata
Automata on infinite words (ω-automata) have wide applications in formal language theory as well as in modeling and verifying reactive systems. Complementation of ωautomata is ...
Yang Cai, Ting Zhang, Haifeng Luo
ADHOCNOW
2008
Springer
16 years 29 days ago
DIN: An Ad-Hoc Algorithm to Estimate Distances in Wireless Sensor Networks
Abstract. A current challenge in wireless sensor networks is the positioning of sensor nodes for indoor environments without dedicated hardware. Especially in this domain, many app...
Freddy López Villafuerte, Jochen H. Schille...
WACV
2005
IEEE
16 years 5 days ago
Requirements for Camera Calibration: Must Accuracy Come with a High Price?
While a large number of vision applications rely on the mapping between 3D scenes and their corresponding 2D camera images, the question that occurs to most researchers is what, i...
Wei Sun, Jeremy R. Cooperstock