Sciweavers

310 search results - page 56 / 62
» Why Delannoy numbers
Sort
View
WS
2003
ACM
14 years 3 months ago
Rushing attacks and defense in wireless ad hoc network routing protocols
In an ad hoc network, mobile computers (or nodes) cooperate to forward packets for each other, allowing nodes to communicate beyond their direct wireless transmission range. Many ...
Yih-Chun Hu, Adrian Perrig, David B. Johnson
HT
2010
ACM
14 years 2 months ago
Of categorizers and describers: an evaluation of quantitative measures for tagging motivation
While recent research has advanced our understanding about the structure and dynamics of social tagging systems, we know little about (i) the underlying motivations for tagging (w...
Christian Körner, Roman Kern, Hans-Peter Grah...
COMPSAC
2002
IEEE
14 years 2 months ago
Dependency Analysis and Visualization as Tools to Prolong System Life
This paper describes our experience using dependency analysis and visualization as a tool to identify intervention points for migrating applications to environments where they can...
Dave McComb, Simon Robe, Simon Hoare, Stew Crawfor...
IWPC
2002
IEEE
14 years 2 months ago
Comprehension of Object-Oriented Software Cohesion: The Empirical Quagmire
It is a little over ten years since Chidamber and Kemerer's obje ct-oriented (OO) metric suite which included the Lack of Cohesion Of Methods (LCOM) metric was rst proposed 9...
Steve Counsell, Emilia Mendes, Stephen Swift
ANTS
2000
Springer
133views Algorithms» more  ANTS 2000»
14 years 2 months ago
Lifting Elliptic Curves and Solving the Elliptic Curve Discrete Logarithm Problem
Abstract. Essentially all subexponential time algorithms for the discrete logarithm problem over nite elds are based on the index calculus idea. In proposing cryptosystems based on...
Ming-Deh A. Huang, Ka Lam Kueh, Ki-Seng Tan