Sciweavers

403 search results - page 18 / 81
» A search for positive storage functions
Sort
View
STOC
2003
ACM
178views Algorithms» more  STOC 2003»
16 years 2 months ago
Uniform hashing in constant time and linear space
Many algorithms and data structures employing hashing have been analyzed under the uniform hashing assumption, i.e., the assumption that hash functions behave like truly random fu...
Anna Östlin, Rasmus Pagh
101
Voted
TMC
2011
127views more  TMC 2011»
14 years 8 months ago
Discriminant Minimization Search for Large-Scale RF-Based Localization Systems
— In large-scale fingerprinting localization systems, fine-grained location estimation and quick location determination are conflicting concerns. To achieve finer-grained loc...
Sheng-Po Kuo, Yu-Chee Tseng
BMCBI
2007
144views more  BMCBI 2007»
15 years 1 months ago
Gene analogue finder: a GRID solution for finding functionally analogous gene products
Background: To date more than 2,1 million gene products from more than 100000 different species have been described specifying their function, the processes they are involved in a...
Angelica Tulipano, Giacinto Donvito, Flavio Licciu...
WWW
2011
ACM
14 years 8 months ago
Learning to rank with multiple objective functions
We investigate the problem of learning to rank for document retrieval from the perspective of learning with multiple objective functions. We present solutions to two open problems...
Krysta Marie Svore, Maksims Volkovs, Christopher J...
ERCIMDL
2001
Springer
178views Education» more  ERCIMDL 2001»
15 years 6 months ago
Customizable Retrieval Functions Based on User Tasks in the Cultural Heritage Domain
The cultural heritage domain dealing with digital surrogates of rare and fragile historic artifacts is one of the most promising areas for establishing collaboratories, i.e. shared...
Holger Brocks, Ulrich Thiel, Adelheit Stein, Andre...