Sciweavers

7129 search results - page 258 / 1426
» Approximation Algorithms for Treewidth
Sort
View
SCL
2010
98views more  SCL 2010»
15 years 2 months ago
Symbolic models for nonlinear time-delay systems using approximate bisimulations
In this paper we show that incrementally stable nonlinear time–delay systems admit symbolic models which are approximately equivalent, in the sense of approximate bisimulation, ...
Giordano Pola, Pierdomenico Pepe, Maria Domenica D...
ICDE
2000
IEEE
168views Database» more  ICDE 2000»
16 years 5 months ago
PAC Nearest Neighbor Queries: Approximate and Controlled Search in High-Dimensional and Metric Spaces
In high-dimensional and complex metric spaces, determining the nearest neighbor (NN) of a query object ? can be a very expensive task, because of the poor partitioning operated by...
Paolo Ciaccia, Marco Patella
VLDB
2007
ACM
107views Database» more  VLDB 2007»
16 years 4 months ago
VGRAM: Improving Performance of Approximate Queries on String Collections Using Variable-Length Grams
Many applications need to solve the following problem of approximate string matching: from a collection of strings, how to find those similar to a given string, or the strings in ...
Chen Li, Bin Wang, Xiaochun Yang
ICASSP
2008
IEEE
15 years 10 months ago
Collusion-aware traitor tracing in multimedia fingerprinting using sparse signal approximation
We pose the problem of tracing traitors, who have colluded to circumvent a multimedia fingerprinting system, as a sparse underdetermined linear problem. We propose a range of det...
David P. Varodayan, Christine Pépin
155
Voted
APPROX
2006
Springer
162views Algorithms» more  APPROX 2006»
15 years 8 months ago
Approximating Precedence-Constrained Single Machine Scheduling by Coloring
Abstract. This paper investigates the relationship between the dimension theory of partial orders and the problem of scheduling precedenceconstrained jobs on a single machine to mi...
Christoph Ambühl, Monaldo Mastrolilli, Ola Sv...