Sciweavers

257 search results - page 29 / 52
» On the Complexity of Computing Units in a Number Field
Sort
View
CMG
2000
13 years 10 months ago
Comparing CPU Performance Between and Within Processor Families
Our study compares CPU performance on RISC and CISC uni and multiprocessors of varying speeds, and shows that the Instruction Set Architecture (ISA) style no longer matters. Our s...
Lee A. Butler, Travis Atkison, Ethan L. Miller
PODC
2005
ACM
14 years 2 months ago
On the locality of bounded growth
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...
Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer
CVPR
2010
IEEE
1790views Computer Vision» more  CVPR 2010»
14 years 4 months ago
Data Driven Mean-Shift Belief Propagation For non-Gaussian MRFs
We introduce a novel data-driven mean-shift belief propagation (DDMSBP) method for non-Gaussian MRFs, which often arise in computer vision applications. With the aid of scale sp...
Minwoo Park, S. Kashyap, R. Collins, and Y. Liu
NN
2000
Springer
134views Neural Networks» more  NN 2000»
13 years 8 months ago
Generic modeling of chemotactic based self-wiring of neural networks
The proper functioning of the nervous system depends critically on the intricate network of synaptic connections that are generated during the system development. During the netwo...
Ronen Segev, Eshel Ben-Jacob
CORR
2010
Springer
105views Education» more  CORR 2010»
13 years 3 months ago
Universal and Robust Distributed Network Codes
Random linear network codes can be designed and implemented in a distributed manner, with low computational complexity. However, these codes are classically implemented [1] over fi...
Tracey Ho, Sidharth Jaggi, Svitlana Vyetrenko, Lin...