Sciweavers

1385 search results - page 149 / 277
» Clustering by Random Projections
Sort
View
ECCC
2000
113views more  ECCC 2000»
15 years 6 months ago
Candidate One-Way Functions Based on Expander Graphs
Abstract. We suggest a candidate one-way function using combinatorial constructs such as expander graphs. These graphs are used to determine a sequence of small overlapping subsets...
Oded Goldreich
ICASSP
2011
IEEE
14 years 10 months ago
Compressed classification of observation sets with linear subspace embeddings
We consider the problem of classification of a pattern from multiple compressed observations that are collected in a sensor network. In particular, we exploit the properties of r...
Dorina Thanou, Pascal Frossard
INFOCOM
2002
IEEE
15 years 11 months ago
Using the Small-World Model to Improve Freenet Performance
– Efficient data retrieval in a peer-to-peer system like Freenet is a challenging problem. In this paper we study the impact of cache replacement policy on the performance of Fre...
Hui Zhang 0002, Ashish Goel, Ramesh Govindan
IJMC
2010
139views more  IJMC 2010»
15 years 5 months ago
A realistic mobility model for wireless networks of scale-free node connectivity
: Recently, researchers have discovered that many of social, natural and biological networks are characterized by scale-free powerlaw connectivity distribution and a few densely po...
Sunho Lim, Chansu Yu, Chita R. Das
MIMI
2007
Springer
16 years 18 days ago
CAD on Brain, Fundus, and Breast Images
Three computer-aided detection (CAD) projects are hosted at the Gifu University, Japan as part of the “Knowledge Cluster Initiative” of the Japanese Government. These projects ...
Hiroshi Fujita, Yoshikazu Uchiyama, Toshiaki Nakag...