Sciweavers

1083 search results - page 39 / 217
» On the Number of Optimal Base 2 Representations of Integers
Sort
View
FOCS
2005
IEEE
15 years 11 months ago
Truthful and Near-Optimal Mechanism Design via Linear Programming
We give a general technique to obtain approximation mechanisms that are truthful in expectation. We show that for packing domains, any α-approximation algorithm that also bounds ...
Ron Lavi, Chaitanya Swamy
MICCAI
2007
Springer
16 years 7 days ago
Robust Autonomous Model Learning from 2D and 3D Data Sets
In this paper we propose a weakly supervised learning algorithm for appearance models based on the minimum description length (MDL) principle. From a set of training images or volu...
Georg Langs, Rene Donner, Philipp Peloschek, Horst...
MM
2005
ACM
122views Multimedia» more  MM 2005»
15 years 11 months ago
Image clustering with tensor representation
We consider the problem of image representation and clustering. Traditionally, an n1 × n2 image is represented by a vector in the Euclidean space Rn1×n2 . Some learning algorith...
Xiaofei He, Deng Cai, Haifeng Liu, Jiawei Han
PLDI
2003
ACM
15 years 11 months ago
Taming the IXP network processor
We compile Nova, a new language designed for writing network processing applications, using a back end based on integer-linear programming (ILP) for register allocation, optimal b...
Lal George, Matthias Blume
ICALP
2010
Springer
15 years 11 months ago
Mean-Payoff Games and Propositional Proofs
We associate a CNF-formula to every instance of the mean-payoff game problem in such a way that if the value of the game is non-negative the formula is satisfiable, and if the va...
Albert Atserias, Elitza N. Maneva