Sciweavers

3020 search results - page 283 / 604
» Optimal partition trees
Sort
View
NAACL
2010
15 years 4 months ago
Optimal Parsing Strategies for Linear Context-Free Rewriting Systems
Factorization is the operation of transforming a production in a Linear Context-Free Rewriting System (LCFRS) into two simpler productions by factoring out a subset of the nonterm...
Daniel Gildea
MICCAI
2008
Springer
16 years 7 months ago
Weights and Topology: A Study of the Effects of Graph Construction on 3D Image Segmentation
Abstract. Graph-based algorithms have become increasingly popular for medical image segmentation. The fundamental process for each of these algorithms is to use the image content t...
Leo Grady, Marie-Pierre Jolly
142
Voted
CIAC
2010
Springer
258views Algorithms» more  CIAC 2010»
16 years 4 months ago
A Planar Linear Arboricity Conjecture
The linear arboricity la(G) of a graph G is the minimum number of linear forests that partition the edges of G. In 1984, Akiyama et al. [1] stated the Linear Arboricity Conjecture...
Marek Cygan, Lukasz Kowalik, Borut Luzar
ICAS
2006
IEEE
143views Robotics» more  ICAS 2006»
16 years 23 days ago
Towards Autonomic Distribution of Existing Object Oriented Programs
By harnessing computational power of distributed heterogeneous resources, it is possible to build a large scale integrated system so that a centralized program is partitioned and ...
Debzani Deb, M. Muztaba Fuad, Michael J. Oudshoorn
HPCC
2005
Springer
16 years 7 days ago
A Parallel Distance-2 Graph Coloring Algorithm for Distributed Memory Computers
Abstract. The distance-2 graph coloring problem aims at partitioning the vertex set of a graph into the fewest sets consisting of vertices pairwise at distance greater than two fro...
Doruk Bozdag, Ümit V. Çatalyürek,...