Sciweavers

1545 search results - page 172 / 309
» On tree congestion of graphs
Sort
View
FCT
2005
Springer
15 years 3 months ago
On Finding Acyclic Subhypergraphs
: In this paper, we investigate the problem to find an acyclic subhypergraph in a given hypergraph, which is an extension to find a tree in a graph. First, we introduce a spannin...
Kouichi Hirata, Megumi Kuwabara, Masateru Harao
ICVS
2003
Springer
15 years 3 months ago
Automatic Mapping of Settlement Areas Using a Knowledge-Based Image Interpretation System
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 ...
Bernd-Michael Straub, Markus Gerke, Martin Pahl
NIPS
2007
14 years 11 months ago
Adaptive Embedded Subgraph Algorithms using Walk-Sum Analysis
We consider the estimation problem in Gaussian graphical models with arbitrary structure. We analyze the Embedded Trees algorithm, which solves a sequence of problems on tractable...
Venkat Chandrasekaran, Jason K. Johnson, Alan S. W...
DMDW
2001
194views Management» more  DMDW 2001»
14 years 11 months ago
Logical Multidimensional Database Design for Ragged and Unbalanced Aggregation
Research on logical design of OLAP cubes has tended to assume that the rollup hierarchy in a cube dimension takes the form of a balanced tree. However, experience from industry in...
Tapio Niemi, Jyrki Nummenmaa, Peter Thanisch
NIPS
2001
14 years 11 months ago
Convolution Kernels for Natural Language
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...
Michael Collins, Nigel Duffy