Sciweavers

3250 search results - page 599 / 650
» Parameterized Learning Complexity
Sort
View
118
Voted
BMCBI
2007
147views more  BMCBI 2007»
15 years 2 months ago
Comparative analysis of long DNA sequences by per element information content using different contexts
Background: Features of a DNA sequence can be found by compressing the sequence under a suitable model; good compression implies low information content. Good DNA compression mode...
Trevor I. Dix, David R. Powell, Lloyd Allison, Jul...
145
Voted
JMLR
2008
168views more  JMLR 2008»
15 years 2 months ago
Max-margin Classification of Data with Absent Features
We consider the problem of learning classifiers in structured domains, where some objects have a subset of features that are inherently absent due to complex relationships between...
Gal Chechik, Geremy Heitz, Gal Elidan, Pieter Abbe...
148
Voted
JCB
2006
185views more  JCB 2006»
15 years 2 months ago
A Probabilistic Methodology for Integrating Knowledge and Experiments on Biological Networks
Biological systems are traditionally studied by focusing on a specific subsystem, building an intuitive model for it, and refining the model using results from carefully designed ...
Irit Gat-Viks, Amos Tanay, Daniela Raijman, Ron Sh...
129
Voted
DC
2007
15 years 2 months ago
On private computation in incomplete networks
Suppose that some parties are connected by an incomplete network of reliable and private channels. The parties cooperate to execute some protocol. However, the parties are curious...
Amos Beimel
116
Voted
BMCBI
2004
127views more  BMCBI 2004»
15 years 2 months ago
MolTalk - a programming library for protein structures and structure analysis
Background: Two of the mostly unsolved but increasingly urgent problems for modern biologists are a) to quickly and easily analyse protein structures and b) to comprehensively min...
Alexander V. Diemand, Holger Scheib