Sciweavers

1450 search results - page 290 / 290
» Complexity of Inference in Graphical Models
Sort
View
COMPGEOM
2003
ACM
14 years 3 days ago
Polygon decomposition based on the straight line skeleton
We propose a novel type of decomposition for polygonal shapes. It is thought that, for the task of object recognition, the human visual system uses a part-based representation. De...
Mirela Tanase, Remco C. Veltkamp
CSCLP
2008
Springer
13 years 8 months ago
An Efficient Decision Procedure for Functional Decomposable Theories Based on Dual Constraints
Abstract. Over the last decade, first-order constraints have been efficiently used in the artificial intelligence world to model many kinds of complex problems such as: scheduling,...
Khalil Djelloul
BMCBI
2010
132views more  BMCBI 2010»
13 years 7 months ago
Next generation tools for genomic data generation, distribution, and visualization
Background: With the rapidly falling cost and availability of high throughput sequencing and microarray technologies, the bottleneck for effectively using genomic analysis in the ...
David A. Nix, Tonya L. Di Sera, Brian K. Dalley, B...
CGF
2008
151views more  CGF 2008»
13 years 6 months ago
Navigation and Exploration of Interconnected Pathways
Visualizing pathways, i. e. models of cellular functional networks, is a challenging task in computer assisted biomedicine. Pathways are represented as large collections of interw...
Marc Streit, Michael Kalkusch, Karl Kashofer, Diet...
CGF
2011
12 years 10 months ago
Walking On Broken Mesh: Defect-Tolerant Geodesic Distances and Parameterizations
Efficient methods to compute intrinsic distances and geodesic paths have been presented for various types of surface representations, most importantly polygon meshes. These meshe...
Marcel Campen, Leif Kobbelt