18306 search results - page 388 / 3662 » Algorithmics in Exponential Time |
167
click to vote
ICASSP
2008
IEEE
16 years 1 months ago
2008
IEEE
A new technique to acquire pseudo-noise (PN) sequences has been recently proposed in [1] and [2]. It is based on the paradigm of iterative Message Passing (iMP) to be run on loopy...
210
Voted
COCOON
2007
Springer
16 years 1 months ago
2007
Springer
In this paper, we give linear time algorithms to decide core stability, core largeness, exactness, and extendability of flow games on uniform networks (all edge capacities are 1)....
197
click to vote
ISHPC
2003
Springer
16 years 19 days ago
2003
Springer
Most cluster systems used in high performance computing do not allow process relocation at run-time. Finding an allocation that results in minimal completion time is NP-hard and (n...
189
Voted
DISOPT
2008
15 years 7 months ago
2008
We study the problem of minimizing total latency in machine scheduling with deliveries, which is defined as follows. There is a set of n jobs to be processed by a single machine a...
219
Voted
CORR
2011
Springer
14 years 11 months ago
2011
Springer
We analyze the Synchrosqueezing transform, a consistent and invertible time-frequency analysis tool that can identify and extract oscillating components (of time-varying frequency...