Sciweavers

2746 search results - page 80 / 550
» Bisubmodular Function Minimization
Sort
View
113
Voted
PVLDB
2010
91views more  PVLDB 2010»
15 years 1 months ago
Regret-Minimizing Representative Databases
We propose the k-representative regret minimization query (k-regret) as an operation to support multi-criteria decision making. Like top-k, the k-regret query assumes that users h...
Danupon Nanongkai, Atish Das Sarma, Ashwin Lall, R...
120
Voted
DCC
2006
IEEE
16 years 2 months ago
Evaluation codes and plane valuations
Abstract. We apply tools coming from singularity theory, as Hamburger-Noether expansions, and from valuation theory, as generating sequences, to explicitly describe order functions...
C. Galindo, M. Sanchis
DFT
2003
IEEE
98views VLSI» more  DFT 2003»
15 years 8 months ago
Constrained ATPG for Broadside Transition Testing
In this paper, we propose a new concept of testing only functionally testable transition faults in Broadside Transition testing via a novel constrained ATPG. For each functionally...
Xiao Liu, Michael S. Hsiao
142
Voted
ICASSP
2011
IEEE
14 years 7 months ago
On the design of matched orthonormal wavelets with compact support
We develop new algorithms for designing matched wavelets and matched scaling functions using a new parametrization of compactly supported orthonormal wavelets that is developed in...
Mohamed F. Mansour
MST
2008
157views more  MST 2008»
15 years 3 months ago
Optimal On-Line Algorithms to Minimize Makespan on Two Machines with Resource Augmentation
We study the problem of on-line scheduling on two uniformly related machines where the on-line algorithm has resources different from those of the off-line algorithm. We consider ...
Leah Epstein, Arik Ganot