Sciweavers

5372 search results - page 1070 / 1075
» complexity 2007
Sort
View
JALC
2007
90views more  JALC 2007»
13 years 8 months ago
Learning Unary Automata
We determine the complexity of learning problems for unary regular languages. We begin by investigating the minimum consistent dfa (resp. nfa) problem which is known not to be app...
Gregor Gramlich, Ralf Herrmann
WS
2008
ACM
13 years 8 months ago
Recommendations based on semantically enriched museum collections
This article presents the CHIP demonstrator5 for providing personalized access to digital museum collections. It consists of three main components: Art Recommender, Tour Wizard, an...
Yiwen Wang, Natalia Stash, Lora Aroyo, Peter Gorge...
BMCBI
2010
113views more  BMCBI 2010»
13 years 8 months ago
Probabilistic Principal Component Analysis for Metabolomic Data
Background: Data from metabolomic studies are typically complex and high-dimensional. Principal component analysis (PCA) is currently the most widely used statistical technique fo...
Gift Nyamundanda, Lorraine Brennan, Isobel Claire ...
MTA
2007
141views more  MTA 2007»
13 years 8 months ago
Flexible integration of multimedia sub-queries with qualitative preferences
Complex multimedia queries, aiming to retrieve from large databases those objects that best match the query specification, are usually processed by splitting them into a set of m ...
Ilaria Bartolini, Paolo Ciaccia, Vincent Oria, M. ...
NAR
2007
62views more  NAR 2007»
13 years 8 months ago
MolProbity: all-atom contacts and structure validation for proteins and nucleic acids
MolProbity is a general-purpose web server offering quality validation for 3D structures of proteins, nucleic acids and complexes. It provides detailed all-atom contact analysis o...
Ian W. Davis, Andrew Leaver-Fay, Vincent B. Chen, ...
« Prev « First page 1070 / 1075 Last » Next »