Sciweavers

3775 search results - page 64 / 755
» The Expression Problem Revisited
Sort
View
STACS
2009
Springer
15 years 7 months ago
Generating Shorter Bases for Hard Random Lattices
We revisit the problem of generating a “hard” random lattice together with a basis of relatively short vectors. This problem has gained in importance lately due to new cryptogr...
Joël Alwen, Chris Peikert
105
Voted
ICC
2009
IEEE
122views Communications» more  ICC 2009»
15 years 7 months ago
Using Area Hierarchy for Multi-Resolution Storage and Search in Large Wireless Sensor Networks
—We consider multi-resolution storage, a technique for providing scalable adaptive data fidelity, necessary for many applications of large wireless sensor networks (WSNs). Altho...
Konrad Iwanicki, Maarten van Steen
ESA
1999
Springer
110views Algorithms» more  ESA 1999»
15 years 5 months ago
Geometric Searching over the Rationals
We revisit classical geometric search problems under the assumption of rational coordinates. Our main result is a tight bound for point separation, ie, to determine whether n given...
Bernard Chazelle
101
Voted
AIMSA
2004
Springer
15 years 4 months ago
Advances in Profile Assisted Voicemail Management
Abstract. Spoken audio is an important source of information available to knowledge extraction and management systems. Organization of spoken messages by priority and content can f...
Konstantinos Koumpis
101
Voted
CLUSTER
2001
IEEE
15 years 4 months ago
The Master-Slave Paradigm with Heterogeneous Processors
In this paper, we revisit the master-slave tasking paradigm in the context of heterogeneous processors. We assume that communications take place in exclusive mode. We present a po...
Olivier Beaumont, Arnaud Legrand, Yves Robert