9405 search results - page 1226 / 1881 » Computing a Model of Set Theory |
246
click to vote
SIGECOM
2010
ACM
16 years 1 days ago
2010
ACM
Motivated by the allocation problem facing publishers in display advertising we formulate the online assignment with forecast problem, a version of the online allocation problem w...
195
click to vote
SIGECOM
2010
ACM
16 years 1 days ago
2010
ACM
We design and analyze approximately revenue-maximizing auctions in general single-parameter settings. Bidders have publicly observable attributes, and we assume that the valuation...
196
click to vote
VISUALIZATION
2000
IEEE
15 years 11 months ago
2000
IEEE
Very large irregular-grid data sets are represented as tetrahedral meshes and may incur significant disk I/O access overhead in the rendering process. An effective way to allevia...
230
click to vote
STOC
2010
ACM
15 years 11 months ago
2010
ACM
The spectral profile of a graph is a natural generalization of the classical notion of its Rayleigh quotient. Roughly speaking, given a graph G, for each 0 < < 1, the spect...
193
click to vote
COMPGEOM
2007
ACM
15 years 11 months ago
2007
ACM
We propose a simple variant of kd-trees, called rank-based kd-trees, for sets of points in Rd . We show that a rank-based kd-tree, like an ordinary kd-tree, supports range search ...