Sciweavers

2523 search results - page 229 / 505
» Objective: In Minimum Context
Sort
View
DCC
2005
IEEE
16 years 5 months ago
A Family of Binary (t, m, s)-Nets of Strength 5
(t, m, s)-nets were defined by Niederreiter [6], based on earlier work by Sobol' [7], in the context of quasi-Monte Carlo methods of numerical integration. Formulated in comb...
Jürgen Bierbrauer, Yves Edel
WEA
2010
Springer
330views Algorithms» more  WEA 2010»
16 years 9 days ago
Exact Bipartite Crossing Minimization under Tree Constraints
A tanglegram consists of a pair of (not necessarily binary) trees T1, T2 with leaf sets L1, L2. Additional edges, called tangles, may connect nodes in L1 with those in L2. The task...
Frank Baumann, Christoph Buchheim, Frauke Liers
DELTA
2008
IEEE
15 years 12 months ago
Improved Policies for Drowsy Caches in Embedded Processors
In the design of embedded systems, especially batterypowered systems, it is important to reduce energy consumption. Cache are now used not only in general-purpose processors but a...
Junpei Zushi, Gang Zeng, Hiroyuki Tomiyama, Hiroak...
ICASSP
2008
IEEE
15 years 12 months ago
Time-frequency localization from sparsity constraints
In the case of multicomponent AM-FM signals, the idealized representation which consists of weighted trajectories on the time-frequency (TF) plane, is intrinsically sparse. Recent...
Pierre Borgnat, Patrick Flandrin
NOMS
2008
IEEE
15 years 12 months ago
PathCrawler: Automatic harvesting web infra-structure
Abstract—As network topologies have grown in size and complexity, it is becoming a daunting task for network administrators to keep track the capacity dimensioning of newly insta...
Cesar Marcondes, M. Y. Sanadidi, Mario Gerla, Ramo...