Sciweavers

69 search results - page 11 / 14
» Maximal Intersection Queries in Randomized Input Models
Sort
View
CIE
2006
Springer
14 years 1 months ago
Lower Bounds Using Kolmogorov Complexity
Abstract. In this paper, we survey a few recent applications of Kolmogorov complexity to lower bounds in several models of computation. We consider KI complexity of Boolean functio...
Sophie Laplante
TACAS
2007
Springer
165views Algorithms» more  TACAS 2007»
14 years 3 months ago
Multi-objective Model Checking of Markov Decision Processes
We study and provide efficient algorithms for multi-objective model checking problems for Markov Decision Processes (MDPs). Given an MDP, M, and given multiple linear-time (ω-regu...
Kousha Etessami, Marta Z. Kwiatkowska, Moshe Y. Va...
GIS
2004
ACM
14 years 10 months ago
Time-dependent affine triangulation of spatio-temporal data
In the geometric data model [6], spatio-temporal data are modelled as a finite collection of triangles that are transformed by time-dependent affinities. To facilitate querying an...
Sofie Haesevoets, Bart Kuijpers
ICCV
2007
IEEE
14 years 11 months ago
Interactive Search for Image Categories by Mental Matching
Traditional image retrieval methods require a "query image" to initiate a search for members of an image category. However, when the image database is unstructured, and ...
Marin Ferecatu, Donald Geman
BMCBI
2007
123views more  BMCBI 2007»
13 years 10 months ago
Tracembler - software for in-silico chromosome walking in unassembled genomes
Background: Whole genome shotgun sequencing produces increasingly higher coverage of a genome with random sequence reads. Progressive whole genome assembly and eventual finishing ...
Qunfeng Dong, Matthew D. Wilkerson, Volker Brendel