5699 search results - page 275 / 1140 » Alternating model trees |
181
click to vote
IFIP
2004
Springer
16 years 20 days ago
2004
Springer
Abstract In this paper we introduce the Weighted Suffix Tree, an efficient data structure for computing string regularities in weighted sequences of molecular data. Molecular Wei...
216
click to vote
ICVS
2003
Springer
16 years 15 days ago
2003
Springer
Abstract. We introduce the knowledge-based image interpretation system GeoAIDA and give examples for an image operator, extracting trees from aerial imagery. Moreover we present a ...
170
click to vote
ICCAD
1995
IEEE
15 years 11 months ago
1995
IEEE
: We study the minimum-cost bounded-skew routing tree problem under the Elmore delay model. We presenttwo approachesto construct bounded-skew routing trees: (i) the Boundary Mergin...
244
click to vote
ACL
2006
15 years 8 months ago
2006
This paper proposes a novel composite kernel for relation extraction. The composite kernel consists of two individual kernels: an entity kernel that allows for entity-related feat...
221
click to vote
NIPS
2001
15 years 8 months ago
2001
We describe the application of kernel methods to Natural Language Processing (NLP) problems. In many NLP tasks the objects being modeled are strings, trees, graphs or other discre...