Sciweavers

151 search results - page 3 / 31
» A Cost Analysis of Solving the Amnesia Problems
Sort
View
STOC
2005
ACM
129views Algorithms» more  STOC 2005»
14 years 6 months ago
Learning with attribute costs
We study an extension of the "standard" learning models to settings where observing the value of an attribute has an associated cost (which might be different for differ...
Haim Kaplan, Eyal Kushilevitz, Yishay Mansour
ISPD
2004
ACM
189views Hardware» more  ISPD 2004»
13 years 11 months ago
Almost optimum placement legalization by minimum cost flow and dynamic programming
VLSI placement tools usually work in two steps: First, the cells that have to be placed are roughly spread out over the chip area ignoring disjointness (global placement). Then, i...
Ulrich Brenner, Anna Pauli, Jens Vygen
STOC
2004
ACM
107views Algorithms» more  STOC 2004»
14 years 6 months ago
Primal-dual algorithms for deterministic inventory problems
We consider several classical models in deterministic inventory theory: the single-item lot-sizing problem, the joint replenishment problem, and the multi-stage assembly problem. ...
Retsef Levi, Robin Roundy, David B. Shmoys
CONPAR
1992
13 years 10 months ago
Analysis of an Efficient Distributed Algorithm for Mutual Exclusion (Average-Case Analysis of Path Reversal)
The algorithm designed in [12, 15] was the very first distributed algorithm to solve the mutual exclusion problem in complete networks by using a dynamic logical tree structure as...
Christian Lavault
ICASSP
2011
IEEE
12 years 10 months ago
Maximum likelihood ICA of quaternion Gaussian vectors
This work considers the independent component analysis (ICA) of quaternion random vectors. In particular, we focus on the Gaussian case, and therefore the ICA problem is solved by...
Javier Vía, Daniel P. Palomar, Luis Vielva,...