1778 search results - page 87 / 356 » The Theory of Probabilistic Databases |
121
click to vote
EDBT
2008
ACM
16 years 5 months ago
2008
ACM
Index trees created using distance based indexing are difficult to maintain online since the distance function involved is often costly to compute. This problem is intensified whe...
148
click to vote
STOC
2003
ACM
16 years 5 months ago
2003
ACM
We construct binary codes for fingerprinting. Our codes for n users that are -secure against c pirates have length O(c2 log(n/ )). This improves the codes proposed by Boneh and Sh...
162
click to vote
SIGIR
2006
ACM
15 years 11 months ago
2006
ACM
Combining the output from multiple retrieval sources over the same document collection is of great importance to a number of retrieval tasks such as multimedia retrieval, web retr...
162
click to vote
ATAL
2005
Springer
15 years 11 months ago
2005
Springer
This research aims to develop a model of trust and reputation that will ensure good interactions amongst software agents in large scale open systems. The following are key drivers...
185
Voted
GECCO
2010
Springer
15 years 10 months ago
2010
Springer
The original mechanism by which evolutionary algorithms were to solve problems was to allow for the gradual discovery of sub-solutions to sub-problems, and the automated combinati...