Sciweavers

866 search results - page 149 / 174
» On Short Multiplications and Divisions
Sort
View
TC
2010
14 years 8 months ago
TSS: Efficient Term Set Search in Large Peer-to-Peer Textual Collections
—Previous multikeyword search in DHT-based P2P systems often relies on multiple single keyword search operations, suffering from unacceptable traffic cost and poor accuracy. Prec...
Hanhua Chen, Jun Yan, Hai Jin, Yunhao Liu, Lionel ...
ASIACRYPT
2010
Springer
14 years 8 months ago
Constant-Size Commitments to Polynomials and Their Applications
We introduce and formally define polynomial commitment schemes, and provide two efficient constructions. A polynomial commitment scheme allows a committer to commit to a polynomial...
Aniket Kate, Gregory M. Zaverucha, Ian Goldberg
IMCSIT
2010
14 years 7 months ago
Fast Construction of Broadcast Scheduling and Gossiping in Dynamic Ad Hoc Networks
This paper studies the minimum latency broadcast schedule (MLBS) problem in ad hoc networks represented by unit disk graphs. In our approach we use an algorithm, which does not nee...
Krzysztof Krzywdzinski
GW
2009
Springer
174views Biometrics» more  GW 2009»
14 years 7 months ago
Towards a Gesture-Sound Cross-Modal Analysis
This article reports on the exploration of a method based on canonical correlation analysis (CCA) for the analysis of the relationship between gesture and sound in the context of m...
Baptiste Caramiaux, Frédéric Bevilac...
CPC
2010
117views more  CPC 2010»
14 years 7 months ago
On the Number of Perfect Matchings in Random Lifts
Let G be a fixed connected multigraph with no loops. A random n-lift of G is obtained by replacing each vertex of G by a set of n vertices (where these sets are pairwise disjoint)...
Catherine S. Greenhill, Svante Janson, Andrzej Ruc...