70 search results - page 2 / 14 » An Exact Characterization of Greedy Structures |
BIRD
2008
Springer
13 years 7 months ago
2008
Springer
Finding motifs in biological sequences is one of the most intriguing problems for string algorithms designers due to, on the one hand, the numerous applications of this problem in...
UAI
2008
13 years 6 months ago
2008
Chordal graphs can be used to encode dependency models that are representable by both directed acyclic and undirected graphs. This paper discusses a very simple and efficient algo...
SIGGRAPH
1999
ACM
13 years 9 months ago
1999
ACM
We present a solution to the general problem of characterizing shadows in scenes involving a uniform polygonal area emitter and a polygonal occluder in arbitrary position by manif...
APPML
2002
13 years 5 months ago
2002
A method for structural clustering proposed by the authors is extended to the case when there are externally de ned restrictions on the relations between sets and their elements. ...
JAC
2008
13 years 6 months ago
2008
Abstract. Recent work has shown that many cellular automata (CA) have configurations whose orbit closures are isomorphic to odometers. We investigate the geometry of the spacetime ...