Sciweavers

93 search results - page 11 / 19
» Fast Random Walk with Restart and Its Applications
Sort
View
CORR
2004
Springer
104views Education» more  CORR 2004»
13 years 7 months ago
Ramanujan Graphs and the Random Reducibility of Discrete Log on Isogenous Elliptic Curves
Cryptographic applications using an elliptic curve over a finite field filter curves for suitability using their order as the primary criterion: e.g. checking that their order has...
David Jao, Stephen D. Miller, Ramarathnam Venkates...
GLOBECOM
2010
IEEE
13 years 5 months ago
A Distributed Wake-Up Scheduling for Opportunistic Forwarding in Wireless Sensor Networks
In wireless sensor networks (WSNs), sensor nodes are typically subjected to energy constraints and often prone to topology changes. While duty cycling has been widely used for ener...
Chul-Ho Lee, Do Young Eun
MOBICOM
2010
ACM
13 years 8 months ago
Did you see Bob?: human localization using mobile phones
Finding a person in a public place, such as in a library, conference hotel, or shopping mall, can be difficult. The difficulty arises from not knowing where the person may be at t...
Ionut Constandache, Xuan Bao, Martin Azizyan, Romi...
KDD
1998
ACM
145views Data Mining» more  KDD 1998»
13 years 12 months ago
Coincidence Detection: A Fast Method for Discovering Higher-Order Correlations in Multidimensional Data
Wepresent a novel, fast methodfor associationminingill high-dimensionaldatasets. OurCoincidence Detection method, which combines random sampling and Chernoff-Hoeffding bounds with...
Evan W. Steeg, Derek A. Robinson, Ed Willis
STOC
2007
ACM
106views Algorithms» more  STOC 2007»
14 years 8 months ago
One sketch for all: fast algorithms for compressed sensing
Compressed Sensing is a new paradigm for acquiring the compressible signals that arise in many applications. These signals can be approximated using an amount of information much ...
Anna C. Gilbert, Martin J. Strauss, Joel A. Tropp,...