628 search results - page 125 / 126 » Approximation Algorithms for Quickest Spanning Tree Problems |
95
Voted
TIT
2008
14 years 9 months ago
2008
Variable-to-variable codes are very attractive yet not well understood data compression schemes. In 1972 Khodak claimed to provide upper and lower bounds for the achievable redund...
118
Voted
ICDM
2010
IEEE
14 years 7 months ago
2010
IEEE
Regression problems on massive data sets are ubiquitous in many application domains including the Internet, earth and space sciences, and finances. In many cases, regression algori...
100
click to vote
SIGMOD
2011
ACM
14 years 10 days ago
2011
ACM
Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labe...
91
Voted
INFOCOM
2008
IEEE
15 years 3 months ago
2008
IEEE
—We introduce Zen, a new resource allocation framework that assigns application components to node clusters to achieve high availability for partial-fault tolerant (PFT) applicat...
GECCO
2003
Springer
15 years 2 months ago
2003
Springer
The performance of genetic programming relies mostly on population-contained variation. If the population diversity is low then there will be a greater chance of the algorithm bein...