Sciweavers

1909 search results - page 219 / 382
» Generalized Filtering Decomposition
Sort
View
126
Voted
LCTRTS
2009
Springer
15 years 9 months ago
Live-range unsplitting for faster optimal coalescing
Register allocation is often a two-phase approach: spilling of registers to memory, followed by coalescing of registers. Extreme liverange splitting (i.e. live-range splitting aft...
Sandrine Blazy, Benoît Robillard
ISCAS
2008
IEEE
217views Hardware» more  ISCAS 2008»
15 years 9 months ago
Approximate L0 constrained non-negative matrix and tensor factorization
— Non-negative matrix factorization (NMF), i.e. V ≈ WH where both V, W and H are non-negative has become a widely used blind source separation technique due to its part based r...
Morten Mørup, Kristoffer Hougaard Madsen, L...
ESA
2004
Springer
145views Algorithms» more  ESA 2004»
15 years 7 months ago
Flows on Few Paths: Algorithms and Lower Bounds
Abstract. Classical network flow theory allows decomposition of flow into several chunks of arbitrary sizes traveling through the network on different paths. In the first part ...
Maren Martens, Martin Skutella
PODC
2010
ACM
15 years 6 months ago
A new technique for distributed symmetry breaking
We introduce Multi-Trials, a new technique for symmetry breaking for distributed algorithms and apply it to various problems in general graphs. For instance, we present three rand...
Johannes Schneider, Roger Wattenhofer
161
Voted
SODA
2012
ACM
243views Algorithms» more  SODA 2012»
13 years 4 months ago
Bidimensionality and geometric graphs
Bidimensionality theory was introduced by Demaine et al. [JACM 2005 ] as a framework to obtain algorithmic results for hard problems on minor closed graph classes. The theory has ...
Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh