Sciweavers

4451 search results - page 99 / 891
» On Random Ordering Constraints
Sort
View
CSCLP
2006
Springer
15 years 8 months ago
Efficient Recognition of Acyclic Clustered Constraint Satisfaction Problems
Abstract. In this paper we present a novel approach to solving Constraint Satisfaction Problems whose constraint graphs are highly clustered and the graph of clusters is close to b...
Igor Razgon, Barry O'Sullivan
IPCO
2007
98views Optimization» more  IPCO 2007»
15 years 5 months ago
Scheduling with Precedence Constraints of Low Fractional Dimension
Abstract. We consider the single machine scheduling problem to minimize the average weighted completion time under precedence constrains. Improving on the various 2-approximation a...
Christoph Ambühl, Monaldo Mastrolilli, Nikola...
ICML
2009
IEEE
16 years 5 months ago
Multi-class image segmentation using conditional random fields and global classification
A key aspect of semantic image segmentation is to integrate local and global features for the prediction of local segment labels. We present an approach to multi-class segmentatio...
Nils Plath, Marc Toussaint, Shinichi Nakajima
TOG
2008
103views more  TOG 2008»
15 years 4 months ago
Sketch-based tree modeling using Markov random field
In this paper, we describe a new system for converting a user's freehand sketch of a tree into a full 3D model that is both complex and realistic-looking. Our system does thi...
Xuejin Chen, Boris Neubert, Ying-Qing Xu, Oliver D...
IJCGA
2006
79views more  IJCGA 2006»
15 years 4 months ago
Well-constrained Completion and Decomposition for under-constrained Geometric Constraint Problems
In this paper, we consider the optimal well-constrained completion problem, that is, for an under-constrained geometric constraint problem, add automatically new constraints in suc...
Gui-Fang Zhang, Xiao-Shan Gao