2496 search results - page 185 / 500 » On covering by translates of a set |
211
click to vote
VMCAI
2012
Springer
14 years 2 months ago
2012
Springer
stractions for Well-Structured Transition Systems Damien Zufferey1 , Thomas Wies2 , and Thomas A. Henzinger1 1 IST Austria 2 New York University Many infinite state systems can be...
156
click to vote
CHI
2002
ACM
16 years 7 months ago
2002
ACM
Title of Dissertation: INTERACTIVE GRAPHICAL QUERYING OF TIME SERIES AND LINEAR SEQUENCE DATA SETS Harry Hochheiser, Doctor of Philosophy, 2003 Dissertation directed by: Professor...
161
click to vote
ACSC
2007
IEEE
16 years 28 days ago
2007
IEEE
This paper presents new algorithms for computing single source shortest paths (SSSPs) in a nearly acyclic directed graph G. The first part introduces higher-order decomposition. ...
183
click to vote
ALMOB
2006
15 years 6 months ago
2006
The String Barcoding (SBC) problem, introduced by Rash and Gusfield (RECOMB, 2002), consists in finding a minimum set of substrings that can be used to distinguish between all mem...
143
click to vote
CIARP
2004
Springer
15 years 12 months ago
2004
Springer
In this paper we describe a heuristic approach to the problem of identifying a pattern embedded within a figure from a predefined set of patterns via the utilization of a genetic a...