Sciweavers

2125 search results - page 320 / 425
» On Graph Complexity
Sort
View
BIRTHDAY
2010
Springer
14 years 9 days ago
Choiceless Computation and Symmetry
Many natural problems in computer science concern structures like graphs where elements are not inherently ordered. In contrast, Turing machines and other common models of computa...
Benjamin Rossman
AI
2010
Springer
13 years 11 months ago
Kernel functions for case-based planning
Case-based planning can take advantage of former problem-solving experiences by storing in a plan library previously generated plans that can be reused to solve similar planning p...
Ivan Serina
BMCBI
2006
142views more  BMCBI 2006»
13 years 11 months ago
Correlated fragile site expression allows the identification of candidate fragile genes involved in immunity and associated with
Background: Common fragile sites (cfs) are specific regions in the human genome that are particularly prone to genomic instability under conditions of replicative stress. Several ...
Angela Re, Davide Corà, Alda Maria Puliti, ...
COMGEO
2006
ACM
13 years 11 months ago
Computing homotopic shortest paths efficiently
Geometric shortest paths are a major topic in computational geometry; see the survey paper by Mitchell [12]. A shortest path between two points in a simple polygon can be found in...
Alon Efrat, Stephen G. Kobourov, Anna Lubiw
PAMI
2008
182views more  PAMI 2008»
13 years 11 months ago
A Hierarchical Compositional Model for Face Representation and Sketching
This paper presents a hierarchical-compositional model of human faces, as a three-layer AND-OR graph to account for the structural variabilities over multiple resolutions. In the A...
Zijian Xu, Hong Chen, Song Chun Zhu, Jiebo Luo