Sciweavers

2926 search results - page 521 / 586
» Partially Optimal Routing
Sort
View
129
Voted
JGAA
2000
179views more  JGAA 2000»
15 years 2 months ago
Approximation Algorithms for Some Graph Partitioning Problems
This paper considers problems of the following type: given an edgeweighted k-colored input graph with maximum color class size c, find a minimum or maximum c-way cut such that eac...
George He, Jiping Liu, Cheng Zhao
116
Voted
MST
2000
101views more  MST 2000»
15 years 2 months ago
Robust Parallel Computations through Randomization
In this paper we present an efficient general simulation strategy for computations designed for fully operational BSP machines of n ideal processors, on n-processor dynamic-fault-p...
Spyros C. Kontogiannis, Grammati E. Pantziou, Paul...
106
Voted
SIAMCOMP
1998
111views more  SIAMCOMP 1998»
15 years 2 months ago
Computing the Local Consensus of Trees
The inference of consensus from a set of evolutionary trees is a fundamental problem in a number of fields such as biology and historical linguistics, and many models for inferrin...
Sampath Kannan, Tandy Warnow
147
Voted
TIP
1998
162views more  TIP 1998»
15 years 2 months ago
Variational image segmentation using boundary functions
Abstract—A general variational framework for image approximation and segmentation is introduced. By using a continuous “line-process” to represent edge boundaries, it is poss...
Gary A. Hewer, Charles S. Kenney, B. S. Manjunath
108
Voted
TASLP
2002
84views more  TASLP 2002»
15 years 2 months ago
Substate tying with combined parameter training and reduction in tied-mixture HMM design
Two approaches are proposed for the design of tied-mixture hidden Markov models (TMHMM). One approach improves parameter sharing via partial tying of TMHMM states. To facilitate ty...
Liang Gu, Kenneth Rose