Sciweavers

154 search results - page 21 / 31
» Near Best Tree Approximation
Sort
View
ESA
1993
Springer
140views Algorithms» more  ESA 1993»
13 years 11 months ago
Fully Dynamic Algorithms for Bin Packing: Being (mostly) Myopic Helps
The problem of maintaining an approximate solution for one-dimensional bin packing when items may arrive and depart dynamically is studied. In accordance with various work on fully...
Zoran Ivkovic, Errol L. Lloyd
NIPS
2004
13 years 9 months ago
Incremental Algorithms for Hierarchical Classification
We study the problem of hierarchical classification when labels corresponding to partial and/or multiple paths in the underlying taxonomy are allowed. We introduce a new hierarchi...
Nicolò Cesa-Bianchi, Claudio Gentile, Andre...
ACL
2010
13 years 5 months ago
Profiting from Mark-Up: Hyper-Text Annotations for Guided Parsing
We show how web mark-up can be used to improve unsupervised dependency parsing. Starting from raw bracketings of four common HTML tags (anchors, bold, italics and underlines), we ...
Valentin I. Spitkovsky, Daniel Jurafsky, Hiyan Als...
IJIT
2004
13 years 9 months ago
Computing Entropy for Ortholog Detection
Abstract-- Biological sequences from different species are called orthologs if they evolved from a sequence of a common ancestor species and they have the same biological function....
Hsing-Kuo Pao, John Case
FOCS
2007
IEEE
14 years 1 months ago
Adaptive Simulated Annealing: A Near-optimal Connection between Sampling and Counting
We present a near-optimal reduction from approximately counting the cardinality of a discrete set to approximately sampling elements of the set. An important application of our wo...
Daniel Stefankovic, Santosh Vempala, Eric Vigoda