Sciweavers

664 search results - page 85 / 133
» Some results for a class of generalized polynomials
Sort
View
WWW
2011
ACM
14 years 4 months ago
An expressive mechanism for auctions on the web
Auctions are widely used on the Web. Applications range from internet advertising to platforms such as eBay. In most of these applications the auctions in use are single/multi-ite...
Paul Dütting, Monika Henzinger, Ingmar Weber
CGO
2003
IEEE
15 years 1 months ago
Optimal and Efficient Speculation-Based Partial Redundancy Elimination
Existing profile-guided partial redundancy elimination (PRE) methods use speculation to enable the removal of partial redundancies along more frequently executed paths at the expe...
Qiong Cai, Jingling Xue
ICALP
2009
Springer
15 years 10 months ago
Counting Subgraphs via Homomorphisms
We introduce a generic approach for counting subgraphs in a graph. The main idea is to relate counting subgraphs to counting graph homomorphisms. This approach provides new algori...
Omid Amini, Fedor V. Fomin, Saket Saurabh
APPROX
2011
Springer
242views Algorithms» more  APPROX 2011»
13 years 9 months ago
New Tools for Graph Coloring
How to color 3 colorable graphs with few colors is a problem of longstanding interest. The best polynomial-time algorithm uses n0.2072 colors. There are no indications that colori...
Sanjeev Arora, Rong Ge
STOC
2009
ACM
161views Algorithms» more  STOC 2009»
15 years 10 months ago
List decoding tensor products and interleaved codes
We design the first efficient algorithms and prove new combinatorial bounds for list decoding tensor products of codes and interleaved codes. ? We show that for every code, the rat...
Parikshit Gopalan, Venkatesan Guruswami, Prasad Ra...