Sciweavers

380 search results - page 34 / 76
» Generalizing foraging theory for analysis and design
Sort
View
SIGECOM
2008
ACM
152views ECommerce» more  SIGECOM 2008»
15 years 6 months ago
On characterizations of truthful mechanisms for combinatorial auctions and scheduling
We characterize truthful mechanisms in two multi-parameter domains. The first characterization shows that every mechanism for combinatorial auctions with two subadditive bidders t...
Shahar Dobzinski, Mukund Sundararajan
156
Voted
CLEIEJ
2008
97views more  CLEIEJ 2008»
15 years 6 months ago
A finite bidimensional wavelet framework for computer graphics: Image equalization
A lot of material has been written about wavelet theory. Most of these texts provide an elegant framework from the functional and real analysis point of view. The complete infinit...
Francisco Jose Benavides Murillo, Edgar Benavides ...
PLDI
2004
ACM
15 years 11 months ago
The set constraint/CFL reachability connection in practice
Many program analyses can be reduced to graph reachability problems involving a limited form of context-free language reachability called Dyck-CFL reachability. We show a new redu...
John Kodumal, Alexander Aiken
COMPGEOM
2011
ACM
14 years 9 months ago
Compressive sensing with local geometric features
We propose a framework for compressive sensing of images with local geometric features. Specifically, let x ∈ RN be an N-pixel image, where each pixel p has value xp. The image...
Rishi Gupta, Piotr Indyk, Eric Price, Yaron Rachli...
HICSS
2009
IEEE
116views Biometrics» more  HICSS 2009»
16 years 27 days ago
Systems Modeling for IP-Based Handoff Using Timed Petri Nets
The mechanisms and design principles needed for achieving optimized handoff for mobile Internet services are poorly understood and need better analysis. This paper contributes to ...
Ashutosh Dutta, Bryan Lyles, Henning Schulzrinne, ...