Sciweavers

2925 search results - page 344 / 585
» Information Complexity of Online Problems
Sort
View
ECML
2006
Springer
15 years 8 months ago
Learning Stochastic Tree Edit Distance
Trees provide a suited structural representation to deal with complex tasks such as web information extraction, RNA secondary structure prediction, or conversion of tree structured...
Marc Bernard, Amaury Habrard, Marc Sebban
COCO
2008
Springer
129views Algorithms» more  COCO 2008»
15 years 6 months ago
Constraint Logic: A Uniform Framework for Modeling Computation as Games
We introduce a simple game family, called Constraint Logic, where players reverse edges in a directed graph while satisfying vertex in-flow constraints. This game family can be in...
Erik D. Demaine, Robert A. Hearn
104
Voted
COLT
2008
Springer
15 years 6 months ago
An Efficient Reduction of Ranking to Classification
This paper describes an efficient reduction of the learning problem of ranking to binary classification. The reduction guarantees an average pairwise misranking regret of at most t...
Nir Ailon, Mehryar Mohri
TVCG
2008
96views more  TVCG 2008»
15 years 4 months ago
Visualization of Cellular and Microvascular Relationships
Understanding the structure of microvasculature structures and their relationship to cells in biological tissue is an important and complex problem. Brain microvasculature in parti...
David Mayerich, Louise Abbott, John Keyser
CANDC
2002
ACM
15 years 4 months ago
Applications of Recursive Segmentation to the Analysis of DNA Sequences
Recursive segmentation is a procedure that partitions a DNA sequence into domains with a homogeneous composition of the four nucleotides A, C, G and T. This procedure can also be ...
Wentian Li, Pedro Bernaola-Galván, Fatameh ...