436 search results - page 25 / 88 » Recursion and Complexity |
IEEECIT
2010
IEEE
13 years 6 months ago
2010
IEEE
—As we all know, Hanoi Problem is a classical case of recursive algorithm in programming. In this paper, we study the problem in another way by numbering the peg from bottom to t...
CIKM
2008
Springer
13 years 9 months ago
2008
Springer
Searching data streams has been traditionally very limited, either in the complexity of the search or in the size of the searched dataset. In this paper, we investigate the design...
TAPSOFT
1997
Springer
13 years 12 months ago
1997
Springer
This paper considers the complexity of interprocedural function pointer may-alias analysis, i.e., determining the set of functions that a function pointer (in a language such as C...
IANDC
2007
13 years 7 months ago
2007
Cryptographic protocols can be divided into (1) protocols where the protocol steps are simple from a computational point of view and can thus be modeled by simple means, for insta...
ICASSP
2009
IEEE
14 years 2 months ago
2009
IEEE
The batch least-absolute shrinkage and selection operator (Lasso) has well-documented merits for estimating sparse signals of interest emerging in various applications, where obse...