Sciweavers

1170 search results - page 43 / 234
» How Fast Is Too Fast
Sort
View
113
Voted
SODA
2008
ACM
144views Algorithms» more  SODA 2008»
15 years 4 months ago
Fast dimension reduction using Rademacher series on dual BCH codes
The Fast Johnson-Lindenstrauss Transform (FJLT) was recently discovered by Ailon and Chazelle as a novel technique for performing fast dimension reduction with small distortion fr...
Nir Ailon, Edo Liberty
97
Voted
TKDE
1998
102views more  TKDE 1998»
15 years 2 months ago
Fast and Effective Retrieval of Medical Tumor Shapes
—We investigate the problem of retrieving similar shapes from a large database; in particular, we focus on medical tumor shapes (“Find tumors that are similar to a given patter...
Flip Korn, Nikolaos Sidiropoulos, Christos Falouts...
146
Voted
TC
2002
15 years 2 months ago
Fast Asynchronous Uniform Consensus in Real-Time Distributed Systems
We investigate whether asynchronous computational models and asynchronous algorithms can be considered for designing real-time distributed fault-tolerant systems. A priori, the lac...
Jean-François Hermant, Gérard Le Lan...
115
Voted
SBBD
2000
168views Database» more  SBBD 2000»
15 years 3 months ago
Fast Feature Selection Using Fractal Dimension
Dimensionalitycurse and dimensionalityreduction are two issues that have retained highinterest for data mining, machine learning, multimedia indexing, and clustering. We present a...
Caetano Traina Jr., Agma J. M. Traina, Leejay Wu, ...
132
Voted
INFOCOM
2011
IEEE
14 years 6 months ago
Physical layer wireless security made fast and channel independent
Abstract – There is a growing interest in physical layer security. Recent work has demonstrated that wireless devices can generate a shared secret key by exploiting variations in...
Shyamnath Gollakota, Dina Katabi