2137 search results - page 354 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
138
click to vote
COMPGEOM
2006
ACM
15 years 6 months ago
2006
ACM
Despite extensive study over the last four decades and numerous applications, no I/O-efficient algorithm is known for the union-find problem. In this paper we present an I/O-effic...
195
Voted
SIGMOD
2005
ACM
16 years 2 months ago
2005
ACM
Statistical estimation and approximate query processing have become increasingly prevalent applications for database systems. However, approximation is usually of little use witho...
132
click to vote
IPPS
2009
IEEE
15 years 9 months ago
2009
IEEE
We are interested in this paper to study scheduling problems in systems where many users compete to perform their respective jobs on shared parallel resources. Each user has speci...
130
click to vote
RECSYS
2010
ACM
15 years 2 months ago
2010
ACM
An increasing number of social networking platforms are giving users the option to endorse entities that they find appealing, such as videos, photos, or even other users. We defin...
148
click to vote
JAIR
2010
15 years 27 days ago
2010
Decentralized planning in uncertain environments is a complex task generally dealt with by using a decision-theoretic approach, mainly through the framework of Decentralized Parti...