539 search results - page 25 / 108 » Recurrence relations and fast algorithms |
126
Voted
OPODIS
2004
15 years 1 months ago
2004
A localized Delaunay triangulation owns the following interesting properties in a wireless ad hoc setting: it can be built with localized information, the communication cost impos...
107
click to vote
ICML
2008
IEEE
16 years 1 months ago
2008
IEEE
In inductive logic programming, subsumption is a widely used coverage test. Unfortunately, testing -subsumption is NP-complete, which represents a crucial efficiency bottleneck fo...
113
click to vote
CAV
2003
Springer
15 years 5 months ago
2003
Springer
We show that the model checking problem for µ-calculus on graphs of bounded tree-width can be solved in time linear in the size of the system. The result is presented by first sh...
105
Voted
JDCTA
2010
14 years 7 months ago
2010
Straight line is the most basic element of graphics, and it is of great significance to study fast algorithm of line generating. On the basis of Bresenham algorithm, this paper co...
81
Voted
CORR
2006
Springer
15 years 13 days ago
2006
Springer
In this paper, we present a fast algorithm for constructing a concept (Galois) lattice of a binary relation, including computing all concepts and their lattice order. We also prese...