94 search results - page 13 / 19 » Genericity, Randomness, and Polynomial-Time Approximations |
158
click to vote
NIPS
2008
15 years 5 months ago
2008
Conditional Random Sampling (CRS) was originally proposed for efficiently computing pairwise (l2, l1) distances, in static, large-scale, and sparse data. This study modifies the o...
130
click to vote
ESA
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. Most recent papers addressing the algorithmic problem of allocating advertisement space for keywords in sponsored search auctions assume that pricing is done via a first...
160
click to vote
ICALP
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We deal with two intimately related subjects: quasi-randomness and regular partitions. The purpose of the concept of quasi-randomness is to measure how much a given graph...
134
click to vote
ICALP
2005
Springer
15 years 10 months ago
2005
Springer
Virtual Private Network Design is the following NP-hard problem. We are given a communication network, represented as a weighted graph with thresholds on the nodes which represent...
145
click to vote
CORR
2007
Springer
15 years 4 months ago
2007
Springer
Many data analysis applications deal with large matrices and involve approximating the matrix using a small number of “components.” Typically, these components are linear combi...