Sciweavers

3250 search results - page 162 / 650
» Parameterized Learning Complexity
Sort
View
STOC
2004
ACM
150views Algorithms» more  STOC 2004»
16 years 6 months ago
Typical properties of winners and losers in discrete optimization
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
René Beier, Berthold Vöcking
BMCBI
2007
115views more  BMCBI 2007»
15 years 6 months ago
Recognizing protein-protein interfaces with empirical potentials and reduced amino acid alphabets
Background: In structural genomics, an important goal is the detection and classification of protein–protein interactions, given the structures of the interacting partners. We h...
Guillaume Launay, Raul Mendez, Shoshana J. Wodak, ...
ICML
2008
IEEE
16 years 7 months ago
ManifoldBoost: stagewise function approximation for fully-, semi- and un-supervised learning
We introduce a boosting framework to solve a classification problem with added manifold and ambient regularization costs. It allows for a natural extension of boosting into both s...
Nicolas Loeff, David A. Forsyth, Deepak Ramachandr...
ECTEL
2007
Springer
16 years 19 days ago
LOCO-Analyst: A Tool for Raising Teachers' Awareness in Online Learning Environments
The paper presents LOCO-Analyst, an educational tool for providing teachers with feedback on the relevant aspects of the learning process taking place in a web-based learning envir...
Jelena Jovanovic, Dragan Gasevic, Christopher A. B...
AAAI
2008
15 years 8 months ago
Examining Difficulties Software Developers Encounter in the Adoption of Statistical Machine Learning
Statistical machine learning continues to show promise as a tool for addressing complex problems in a variety of domains. An increasing number of developers are therefore looking ...
Kayur Patel, James Fogarty, James A. Landay, Bever...