Sciweavers

906 search results - page 114 / 182
» Map graphs
Sort
View
FOCS
2006
IEEE
14 years 2 months ago
Better lossless condensers through derandomized curve samplers
Lossless condensers are unbalanced expander graphs, with expansion close to optimal. Equivalently, they may be viewed as functions that use a short random seed to map a source on ...
Amnon Ta-Shma, Christopher Umans
ICRA
2005
IEEE
150views Robotics» more  ICRA 2005»
14 years 1 months ago
Learning Sensor Network Topology through Monte Carlo Expectation Maximization
— We consider the problem of inferring sensor positions and a topological (i.e. qualitative) map of an environment given a set of cameras with non-overlapping fields of view. In...
Dimitri Marinakis, Gregory Dudek, David J. Fleet
PLDI
2004
ACM
14 years 1 months ago
A generalized algorithm for graph-coloring register allocation
Graph-coloring register allocation is an elegant and extremely popular optimization for modern machines. But as currently formulated, it does not handle two characteristics common...
Michael D. Smith, Norman Ramsey, Glenn H. Holloway
ICSE
1995
IEEE-ACM
13 years 11 months ago
A Framework for Selective Recompilation in the Presence of Complex Intermodule Dependencies
Compilers and other programming environment tools derive information from the source code of programs; derived information includes compiled code, interprocedural summary informat...
Craig Chambers, Jeffrey Dean, David Grove
ATVA
2010
Springer
142views Hardware» more  ATVA 2010»
13 years 6 months ago
On Scenario Synchronization
: Narrowing the wide conceptual gap between problem and implementation domains is considered a significant factor within software engineering. Currently, such a relation is often o...
Duc-Hanh Dang, Anh-Hoang Truong, Martin Gogolla