Sciweavers

6894 search results - page 1022 / 1379
» Generation Problems
Sort
View
DCC
2003
IEEE
16 years 6 months ago
The Insecurity of the Elliptic Curve Digital Signature Algorithm with Partially Known Nonces
Nguyen and Shparlinski recently presented a polynomial-time algorithm that provably recovers the signer's secret DSA key when a few bits of the random nonces k (used at each s...
Phong Q. Nguyen, Igor Shparlinski
ICS
2010
Tsinghua U.
16 years 4 months ago
Local Algorithms for Finding Interesting Individuals in Large Networks
: We initiate the study of local, sublinear time algorithms for finding vertices with extreme topological properties -- such as high degree or clustering coefficient -- in large so...
Mickey Brautbar, Michael Kearns
SDM
2009
SIAM
125views Data Mining» more  SDM 2009»
16 years 3 months ago
Providing Privacy through Plausibly Deniable Search.
Query-based web search is an integral part of many people’s daily activities. Most do not realize that their search history can be used to identify them (and their interests). I...
Chris Clifton, Mummoorthy Murugesan
EUROGRAPHICS
2010
Eurographics
16 years 3 months ago
Synthesis of Responsive Motion Using a Dynamic Model
Synthesizing the movements of a responsive virtual character in the event of unexpected perturbations has proven a difficult challenge. To solve this problem, we devise a fully a...
Yuting Ye and C. Karen Liu
ALT
2003
Springer
16 years 3 months ago
On the Learnability of Erasing Pattern Languages in the Query Model
A pattern is a finite string of constant and variable symbols. The erasing language generated by a pattern p is the set of all strings that can be obtained by substituting (possib...
Steffen Lange, Sandra Zilles
« Prev « First page 1022 / 1379 Last » Next »