Sciweavers

1888 search results - page 334 / 378
» Proof theory and computational analysis
Sort
View
SIGECOM
2008
ACM
155views ECommerce» more  SIGECOM 2008»
13 years 8 months ago
Tight information-theoretic lower bounds for welfare maximization in combinatorial auctions
We provide tight information-theoretic lower bounds for the welfare maximization problem in combinatorial auctions. In this problem, the goal is to partition m items among k bidde...
Vahab S. Mirrokni, Michael Schapira, Jan Vondr&aac...
POPL
2003
ACM
14 years 8 months ago
Discovering affine equalities using random interpretation
We present a new polynomial-time randomized algorithm for discovering affine equalities involving variables in a program. The key idea of the algorithm is to execute a code fragme...
Sumit Gulwani, George C. Necula
MOBIHOC
2004
ACM
14 years 8 months ago
Rate allocation in wireless sensor networks with network lifetime requirement
An important performance consideration for wireless sensor networks is the amount of information collected by all the nodes in the network over the course of network lifetime. Sin...
Yiwei Thomas Hou, Yi Shi, Hanif D. Sherali
GECCO
2007
Springer
165views Optimization» more  GECCO 2007»
14 years 2 months ago
Peptide detectability following ESI mass spectrometry: prediction using genetic programming
The accurate quantification of proteins is important in several areas of cell biology, biotechnology and medicine. Both relative and absolute quantification of proteins is often d...
David C. Wedge, Simon J. Gaskell, Simon J. Hubbard...
MM
2005
ACM
146views Multimedia» more  MM 2005»
14 years 2 months ago
Unsupervised content discovery in composite audio
Automatically extracting semantic content from audio streams can be helpful in many multimedia applications. Motivated by the known limitations of traditional supervised approache...
Rui Cai, Lie Lu, Alan Hanjalic