Sciweavers

395 search results - page 35 / 79
» Positive Versions of Polynomial Time
Sort
View
SODA
2008
ACM
127views Algorithms» more  SODA 2008»
14 years 11 months ago
Nondecreasing paths in a weighted graph or: how to optimally read a train schedule
A travel booking office has timetables giving arrival and departure times for all scheduled trains, including their origins and destinations. A customer presents a starting city a...
Virginia Vassilevska
ICIP
2004
IEEE
15 years 11 months ago
Sharing video annotations
This paper describes an approach for locating annotations generated in one video and properly placing them in a second, modified version of the same video. We focus on modificatio...
Yaron Caspi, David Bargeron
LATA
2010
Springer
15 years 3 months ago
Finding Consistent Categorial Grammars of Bounded Value: A Parameterized Approach
Abstract. Kanazawa ([1]) has studied the learnability of several parameterized families of classes of categorial grammars. These classes were shown to be learnable from text, in th...
Christophe Costa Florêncio, Henning Fernau
CORR
2012
Springer
209views Education» more  CORR 2012»
13 years 5 months ago
Aggregation in Probabilistic Databases via Knowledge Compilation
This paper presents a query evaluation technique for positive relational algebra queries with aggregates on a representation system for probabilistic data based on the algebraic s...
Robert Fink, Larisa Han, Dan Olteanu
RECOMB
2002
Springer
15 years 10 months ago
Deconvolving sequence variation in mixed DNA populations
We present an original approach to identifying sequence variants in a mixed DNA population from sequence trace data. The heart of the method is based on parsimony: given a wildtyp...
Andy Wildenberg, Steven Skiena, Pavel Sumazin