2745 search results - page 499 / 549 » A fast algorithm for computing large Fibonacci numbers |
148
click to vote
PEWASUN
2004
ACM
15 years 9 months ago
2004
ACM
Interferences in an ad-hoc network can be defined as a set of constraints that specify which groups of nodes cannot transmit simultaneously, and they have significant implications...
145
click to vote
ADBIS
2009
Springer
15 years 8 months ago
2009
Springer
Identification of all objects in a dataset whose similarity is not less than a specified threshold is of major importance for management, search, and analysis of data. Set similari...
118
click to vote
ECML
2006
Springer
15 years 7 months ago
2006
Springer
In this paper we formulate the problem of grouping the states of a discrete Markov chain of arbitrary order simultaneously with deconvolving its transition probabilities. As the na...
117
click to vote
ICDT
1995
ACM
15 years 7 months ago
1995
ACM
A tuple t1 of relation R subsumes tuple t2 of R, with respect to a query Q if for every database, tuple t1 derives all, and possibly more, answers to query Q than derived by tuple ...
170
click to vote
PUK
2003
15 years 5 months ago
2003
This paper exploits the spatial representation of state space problem graphs to preprocess and enhance heuristic search engines. It combines classical AI exploration with computati...