2539 search results - page 376 / 508 » Updates for Structure Indexes |
128
click to vote
TALG
2008
15 years 4 months ago
2008
We present the rst dynamic algorithm that maintains a clique tree representation of a chordal graph and supports the following operations: (1) query whether deleting or inserting ...
151
click to vote
TSP
2008
15 years 4 months ago
2008
Markov random fields are designed to represent structured dependencies among large collections of random variables, and are well-suited to capture the structure of real-world sign...
162
click to vote
COMGEO
1999
ACM
15 years 4 months ago
1999
ACM
Let S be a set of n points in IRd and let t > 1 be a real number. A t-spanner for S is a directed graph having the points of S as its vertices, such that for any pair p and q o...
163
click to vote
TAPOS
1998
15 years 4 months ago
1998
Building and maintaining the class hierarchy has been recognized as an important but one of the most difficult activities of object-oriented design. Concept (or Galois) lattices a...
118
Voted
NAR
2007
15 years 4 months ago
2007
The wealth of transcript information that has been made publicly available in recent years has led to large pools of individual web sites offering access to bioinformatics softwar...