Sciweavers

34 search results - page 7 / 7
» Implicit Factoring: On Polynomial Time Factoring Given Only ...
Sort
View
KAIS
2008
221views more  KAIS 2008»
13 years 5 months ago
Forecasting skewed biased stochastic ozone days: analyses, solutions and beyond
Much work on skewed, stochastic, high dimensional, and biased datasets usually implicitly solve each problem separately. Recently, we have been approached by Texas Commission on En...
Kun Zhang, Wei Fan
TMM
2010
151views Management» more  TMM 2010»
13 years 14 days ago
SPANC: Optimizing Scheduling Delay for Peer-to-Peer Live Streaming
Abstract--In peer-to-peer (P2P) live streaming using unstructured mesh, packet scheduling is an important factor in overall playback delay. In this paper, we propose a scheduling a...
Tammy Kam-Hung Chan, Shueng-Han Gary Chan, Ali C. ...
APPROX
2009
Springer
126views Algorithms» more  APPROX 2009»
14 years 11 days ago
Improved Inapproximability Results for Maximum k-Colorable Subgraph
We study the maximization version of the fundamental graph coloring problem. Here the goal is to color the vertices of a k-colorable graph with k colors so that a maximum fraction ...
Venkatesan Guruswami, Ali Kemal Sinop
APPROX
2008
Springer
89views Algorithms» more  APPROX 2008»
13 years 7 months ago
Santa Claus Meets Hypergraph Matchings
We consider the problem of max-min fair allocation of indivisible goods. Our focus will be on the restricted version of the problem in which there are m items, each of which assoc...
Arash Asadpour, Uriel Feige, Amin Saberi