Sciweavers

1264 search results - page 244 / 253
» The framework approach for constraint satisfaction
Sort
View
158
Voted
CLA
2007
15 years 3 months ago
An FDP-Algorithm for Drawing Lattices
In this work we want to discuss an algorithm for drawing line diagrams of lattices based on force directed placement (FDP). This widely used technique in graph drawing introduces f...
Christian Zschalig
IJCV
2006
299views more  IJCV 2006»
15 years 1 months ago
Graph Cuts and Efficient N-D Image Segmentation
Combinatorial graph cut algorithms have been successfully applied to a wide range of problems in vision and graphics. This paper focusses on possibly the simplest application of gr...
Yuri Boykov, Gareth Funka-Lea
163
Voted
EMNLP
2010
14 years 12 months ago
Holistic Sentiment Analysis Across Languages: Multilingual Supervised Latent Dirichlet Allocation
In this paper, we develop multilingual supervised latent Dirichlet allocation (MLSLDA), a probabilistic generative model that allows insights gleaned from one language's data...
Jordan L. Boyd-Graber, Philip Resnik
ICCAD
2009
IEEE
147views Hardware» more  ICCAD 2009»
14 years 11 months ago
SAT-based protein design
Computational protein design can be formulated as an optimization problem, where the objective is to identify the sequence of amino acids that minimizes the energy of a given prot...
Noah Ollikainen, Ellen Sentovich, Carlos Coelho, A...
CVPR
2008
IEEE
16 years 3 months ago
Matching images under unstable segmentations
Region based features are getting popular due to their higher descriptive power relative to other features. However, real world images exhibit changes in image segments capturing ...
Varsha Hedau, Himanshu Arora, Narendra Ahuja