Sciweavers

106 search results - page 15 / 22
» Proving Lower Bounds Via Pseudo-random Generators
Sort
View
ICS
2010
Tsinghua U.
14 years 4 months ago
Local Algorithms for Finding Interesting Individuals in Large Networks
: We initiate the study of local, sublinear time algorithms for finding vertices with extreme topological properties -- such as high degree or clustering coefficient -- in large so...
Mickey Brautbar, Michael Kearns
STOC
2010
ACM
200views Algorithms» more  STOC 2010»
14 years 4 months ago
Hardness Amplification in Proof Complexity
We present a generic method for converting any family of unsatisfiable CNF formulas that require large resolution rank into CNF formulas whose refutation requires large rank for p...
Paul Beame, Trinh Huynh and Toniann Pitassi
SIGECOM
2006
ACM
96views ECommerce» more  SIGECOM 2006»
14 years 1 months ago
Non-cooperative multicast and facility location games
We consider a multicast game with selfish non-cooperative players. There is a special source node and each player is interested in connecting to the source by making a routing de...
Chandra Chekuri, Julia Chuzhoy, Liane Lewin-Eytan,...
RECOMB
2008
Springer
14 years 7 months ago
Sorting Cancer Karyotypes by Elementary Operations
Since the discovery of the "Philadelphia chromosome" in chronic myelogenous leukemia in 1960, there is an ongoing intensive research of chromosomal aberrations in cancer....
Michal Ozery-Flato, Ron Shamir
CDC
2009
IEEE
149views Control Systems» more  CDC 2009»
14 years 6 days ago
Robust stabilization of model-based uncertain singularly perturbed systems with networked time-delay
—In this paper, a robust stabilization of the uncertain singularly perturbed system via a networked state feedback with the transmission time-delay is addressed. Taking its nomin...
Zhiming Wang, Wei Liu, Haohui Dai, D. Subbaram Nai...