Sciweavers

492 search results - page 60 / 99
» The number of possibilities for random dating
Sort
View
SIGECOM
2008
ACM
138views ECommerce» more  SIGECOM 2008»
13 years 8 months ago
Generalized scoring rules and the frequency of coalitional manipulability
We introduce a class of voting rules called generalized scoring rules. Under such a rule, each vote generates a vector of k scores, and the outcome of the voting rule is based onl...
Lirong Xia, Vincent Conitzer
RECOMB
2010
Springer
14 years 3 months ago
Genomic DNA k-mer Spectra: Models and Modalities
Background: The empirical frequencies of DNA k-mers in whole genome sequences provide an interesting perspective on genomic complexity, and the availability of large segments of g...
Benny Chor, David Horn, Nick Goldman, Yaron Levy, ...
EDBT
2009
ACM
184views Database» more  EDBT 2009»
14 years 3 months ago
Distributed similarity search in high dimensions using locality sensitive hashing
In this paper we consider distributed K-Nearest Neighbor (KNN) search and range query processing in high dimensional data. Our approach is based on Locality Sensitive Hashing (LSH...
Parisa Haghani, Sebastian Michel, Karl Aberer
VLDB
2004
ACM
137views Database» more  VLDB 2004»
14 years 2 months ago
Schema-Free XQuery
The widespread adoption of XML holds out the promise that document structure can be exploited to specify precise database queries. However, the user may have only a limited knowle...
Yunyao Li, Cong Yu, H. V. Jagadish
DIALM
2004
ACM
161views Algorithms» more  DIALM 2004»
14 years 13 days ago
Batch conflict resolution algorithm with progressively accurate multiplicity estimation
The wireless connectivity, essential for pervasive computing, has ephemeral character and can be used for creating ad hoc networks, sensor networks, connection with RFID tags etc....
Petar Popovski, Frank H. P. Fitzek, Ramjee Prasad