1237 search results - page 56 / 248 » Abstract shade trees |
158
Voted
ESA
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. We provide new tools, such as k-troikas and good subtreerepresentations, that allow us to give fast and simple algorithms computing branchwidth. We show that a graph G ha...
140
Voted
AIME
2003
Springer
15 years 9 months ago
2003
Springer
Abstract. This paper presents the application of a method for mining data in a multi-relational database that contains some information about patients strucked down by chronic hepa...
134
click to vote
RT
1997
Springer
15 years 8 months ago
1997
Springer
Abstract: An object space algorithm for computing shadows in dynamic scenes illuminated by area light sources is presented. A mesh with the shadow boundaries as well as other disco...
141
click to vote
ECML
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. Conditional Random Fields (CRFs) provide a powerful instrument for labeling sequences. So far, however, CRFs have only been considered for labeling sequences over flat al...
160
click to vote
AISC
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. We introduce and study a tactic language, Hitac, for constructing hierarchical proofs, known as hiproofs. The idea of hiproofs is to superimpose a labelled hierarchical n...