Sciweavers

128 search results - page 19 / 26
» Lower bounds for adaptive collect and related objects
Sort
View
CVPR
2009
IEEE
15 years 3 months ago
Learning query-dependent prefilters for scalable image retrieval
We describe an algorithm for similar-image search which is designed to be efficient for extremely large collections of images. For each query, a small response set is selected by...
Lorenzo Torresani (Dartmouth College), Martin Szum...
TCC
2007
Springer
89views Cryptology» more  TCC 2007»
14 years 2 months ago
On Secret Sharing Schemes, Matroids and Polymatroids
Abstract. One of the main open problems in secret sharing is the characterization of the access structures of ideal secret sharing schemes. As a consequence of the results by Brick...
Jaume Martí-Farré, Carles Padr&oacut...
ICALP
2003
Springer
14 years 1 months ago
Degree Distribution of the FKP Network Model
Recently, Fabrikant, Koutsoupias and Papadimitriou [7] introduced a natural and beautifully simple model of network growth involving a trade-off between geometric and network obje...
Noam Berger, Béla Bollobás, Christia...
EOR
2006
128views more  EOR 2006»
13 years 8 months ago
Scatter search for project scheduling with resource availability cost
This paper considers a project scheduling problem with the objective of minimizing resource availability costs, taking into account a deadline for the project and precedence relat...
Denise Sato Yamashita, Vinícius Amaral Arme...
SETA
2010
Springer
173views Mathematics» more  SETA 2010»
13 years 7 months ago
User-Irrepressible Sequences
Protocol sequences are binary and periodic sequences used in multiple-access scheme for collision channel without feedback. Each user reads out the bits from the assigned protocol ...
Kenneth W. Shum, Yijin Zhang, Wing Shing Wong