Sciweavers

50 search results - page 4 / 10
» Is sparse and distributed the coding goal of simple cells
Sort
View
APPROX
2009
Springer
135views Algorithms» more  APPROX 2009»
13 years 12 months ago
Tolerant Linearity Testing and Locally Testable Codes
Abstract. We study tolerant linearity testing under general distributions. Given groups G and H, a distribution µ on G, and oracle access to a function f : G → H, we consider th...
Swastik Kopparty, Shubhangi Saraf
ALGOSENSORS
2010
Springer
13 years 4 months ago
MSDR-D Network Localization Algorithm
Abstract. We present a distributed multi-scale dead-reckoning (MSDR-D) algorithm for network localization that utilizes local distance and angular information for nearby sensors. T...
Kevin Coogan, Varun Khare, Stephen G. Kobourov, Ba...
SMI
2006
IEEE
183views Image Analysis» more  SMI 2006»
13 years 11 months ago
The Generalized Shape Distributions for Shape Matching and Analysis
This paper presents a novel 3D shape descriptor "The Generalized Shape Distributions" for effective shape matching and analysis, by taking advantage of both local and gl...
Yi Liu, Hongbin Zha, Hong Qin
EUROPAR
2008
Springer
13 years 7 months ago
Efficiently Building the Gated Single Assignment Form in Codes with Pointers in Modern Optimizing Compilers
Abstract. Understanding program behavior is at the foundation of program optimization. Techniques for automatic recognition of program constructs characterize the behavior of code ...
Manuel Arenaz, Pedro Amoedo, Juan Touriño
ISCOPE
1998
Springer
13 years 9 months ago
An Object-Oriented Collection of Minimum Degree Algorithms
The multiple minimum degree (MMD) algorithm and its variants have enjoyed 20+ years of research and progress in generating ll-reducing orderings for sparse, symmetric positive de n...
Gary Kumfert, Alex Pothen