84 search results - page 8 / 17 » Maximum Betweenness Centrality: Approximability and Tractabl... |
183
click to vote
ICDE
2002
IEEE
15 years 11 months ago
2002
IEEE
Obtaining fast and good quality approximations to data distributions is a problem of central interest to database management. A variety of popular database applications including,...
PODS
2012
ACM
13 years 2 days ago
2012
ACM
Database theory and database practice are typically the domain of computer scientists who adopt what may be termed an algorithmic perspective on their data. This perspective is ve...
74
Voted
IPPS
2005
IEEE
15 years 3 months ago
2005
IEEE
This paper studies distributed scheduling of parallel I/O data transfers on systems that provide data replication. In our previous work, we proposed a centralized algorithm for so...
146
click to vote
JCO
2006
14 years 9 months ago
2006
We study a novel "coverage by directional sensors" problem with tunable orientations on a set of discrete targets. We propose a Maximum Coverage with Minimum Sensors (MCM...
NIPS
2008
14 years 11 months ago
2008
Ranking is at the heart of many information retrieval applications. Unlike standard regression or classification in which we predict outputs independently, in ranking we are inter...