2745 search results - page 171 / 549 » A fast algorithm for computing large Fibonacci numbers |
124
click to vote
EUROPAR
2001
Springer
15 years 8 months ago
2001
Springer
Discovery of sequential patterns is becoming increasingly useful and essential in many scienti c and commercial domains. Enormous sizes of available datasets and possibly large nu...
110
click to vote
UAI
1997
15 years 5 months ago
1997
It has been shown that a class of probabilistic domain models cannot be learned correctly by several existing algorithms which employ a single-link lookahead search. When a multil...
125
click to vote
CASCON
2006
15 years 5 months ago
2006
Parsing context-dependent computer languages requires an ability to maintain and query data structures while parsing for the purpose of influencing the parse. Parsing ambiguous co...
134
click to vote
ISIPTA
1999
IEEE
15 years 8 months ago
1999
IEEE
This paper reviews algorithms for local computation with imprecise probabilities. These algorithms try to solve problems of inference calculation of conditional or unconditional p...
125
click to vote
IPPS
2007
IEEE
15 years 10 months ago
2007
IEEE
Computational grids clusters, provide powerful computing resources for executing applications of large scale. In Grid (clusters) usually several applications run simultaneously.Th...