Sciweavers

1198 search results - page 205 / 240
» Compiling for EDGE Architectures
Sort
View
149
Voted
MOBICOM
2012
ACM
13 years 5 months ago
Temporal reachability graphs
While a natural fit for modeling and understanding mobile networks, time-varying graphs remain poorly understood. Indeed, many of the usual concepts of static graphs have no obvi...
John Whitbeck, Marcelo Dias de Amorim, Vania Conan...
CLUSTER
2006
IEEE
15 years 9 months ago
MSSG: A Framework for Massive-Scale Semantic Graphs
This paper presents a middleware framework for storing, accessing and analyzing massive-scale semantic graphs. The framework, MSSG, targets scale-free semantic graphs with O(1012 ...
Timothy D. R. Hartley, Ümit V. Çataly&...
MM
2005
ACM
215views Multimedia» more  MM 2005»
15 years 9 months ago
OpenVIDIA: parallel GPU computer vision
Graphics and vision are approximate inverses of each other: ordinarily Graphics Processing Units (GPUs) are used to convert “numbers into pictures” (i.e. computer graphics). I...
James Fung, Steve Mann
152
Voted
CVPR
2009
IEEE
16 years 10 months ago
Learning Invariant Features Through Topographic Filter Maps
Several recently-proposed architectures for highperformance object recognition are composed of two main stages: a feature extraction stage that extracts locallyinvariant feature...
Koray Kavukcuoglu, Marc'Aurelio Ranzato, Rob Fergu...
154
Voted
DAC
2003
ACM
16 years 4 months ago
Performance-impact limited area fill synthesis
Chemical-mechanical planarization (CMP) and other manufacturing steps in very deep-submicron VLSI have varying effects on device and interconnect features, depending on the local ...
Yu Chen, Puneet Gupta, Andrew B. Kahng