Sciweavers

889 search results - page 168 / 178
» A Statistical Shape Model without Using Landmarks
Sort
View
CIE
2007
Springer
14 years 1 months ago
Computational Complexity of Constraint Satisfaction
Abstract. The input to a constraint satisfaction problem (CSP) consists of a set of variables, each with a domain, and constraints between these variables formulated by relations o...
Heribert Vollmer
EMSOFT
2007
Springer
14 years 1 months ago
Loosely time-triggered architectures based on communication-by-sampling
We address the problem of mapping a set of processes which communicate synchronously on a distributed platform. The Time Triggered Architecture (TTA) proposed by Kopetz for the co...
Albert Benveniste, Paul Caspi, Marco Di Natale, Cl...
COMPGEOM
2006
ACM
14 years 1 months ago
Algorithms for two-box covering
We study the problem of covering a set of points or polyhedra in 3 with two axis-aligned boxes in order to minimize a function of the measures of the two boxes, such as the sum or...
Esther M. Arkin, Gill Barequet, Joseph S. B. Mitch...
BMCBI
2010
139views more  BMCBI 2010»
13 years 7 months ago
TOPSAN: a collaborative annotation environment for structural genomics
Background: Many protein structures determined in high-throughput structural genomics centers, despite their significant novelty and importance, are available only as PDB depositi...
Dana Weekes, S. Sri Krishna, Constantina Bakolitsa...
KI
2002
Springer
13 years 7 months ago
Advantages, Opportunities and Limits of Empirical Evaluations: Evaluating Adaptive Systems
While empirical evaluations are a common research method in some areas of Artificial Intelligence (AI), others still neglect this approach. This article outlines both the opportun...
Stephan Weibelzahl, Gerhard Weber