8825 search results - page 1264 / 1765 » All for one or one for all |
123
click to vote
SIGCOMM
2006
ACM
15 years 8 months ago
2006
ACM
Researchers have proposed a variety of metrics to measure important graph properties, for instance, in social, biological, and computer networks. Values for a particular graph met...
100
click to vote
SIGECOM
2006
ACM
15 years 8 months ago
2006
ACM
We present approximation and online algorithms for a number of problems of pricing items for sale so as to maximize seller’s revenue in an unlimited supply setting. Our first r...
103
click to vote
PODC
2005
ACM
15 years 7 months ago
2005
ACM
In this paper we consider the weighted, capacitated vertex cover problem with hard capacities (capVC). Here, we are given an undirected graph G = (V, E), non-negative vertex weigh...
120
click to vote
SIGIR
2005
ACM
15 years 7 months ago
2005
ACM
Accurately and effectively detecting the locations where search queries are truly about has huge potential impact on increasing search relevance. In this paper, we define a search...
139
click to vote
WIKIS
2005
ACM
15 years 7 months ago
2005
ACM
Good documentation benefits every software development project, especially large ones, but it can be hard, costly, and tiresome to produce when not supported by appropriate tools...