13841 search results - page 2472 / 2769 » Algorithms and Constraint Programming |
128
click to vote
DAC
2000
ACM
16 years 5 months ago
2000
ACM
eously demand shorter and less costly design cycles. Designing at higher levels of abstraction makes both objectives achievable, but enabling techniques like behavioral synthesis h...
175
click to vote
DAC
2004
ACM
16 years 5 months ago
2004
ACM
This paper describes a dynamic voltage and frequency scaling (DVFS) technique for MPEG decoding to reduce the energy consumption using the computational workload decomposition. Th...
163
click to vote
STOC
2009
ACM
16 years 5 months ago
2009
ACM
We prove strong lower bounds on integrality gaps of Sherali?Adams relaxations for MAX CUT, Vertex Cover, Sparsest Cut and other problems. Our constructions show gaps for Sherali?A...
124
Voted
STOC
2009
ACM
16 years 5 months ago
2009
ACM
We study integrality gaps for SDP relaxations of constraint satisfaction problems, in the hierarchy of SDPs defined by Lasserre. Schoenebeck [25] recently showed the first integra...
169
click to vote
KDD
2009
ACM
16 years 5 months ago
2009
ACM
Tag recommendation is the task of predicting a personalized list of tags for a user given an item. This is important for many websites with tagging capabilities like last.fm or de...