Sciweavers

316 search results - page 29 / 64
» Metric embedding of view-graphs
Sort
View
CDC
2009
IEEE
221views Control Systems» more  CDC 2009»
13 years 11 months ago
Parametrization invariant covariance quantification in identification of transfer functions for linear systems
This paper adresses the variance quantification problem for system identification based on the prediction error framework. The role of input and model class selection for the auto-...
Tzvetan Ivanov, Michel Gevers
COMPGEOM
2011
ACM
12 years 11 months ago
Comparing distributions and shapes using the kernel distance
Starting with a similarity function between objects, it is possible to define a distance metric (the kernel distance) on pairs of objects, and more generally on probability distr...
Sarang C. Joshi, Raj Varma Kommaraju, Jeff M. Phil...
RTAS
2006
IEEE
14 years 1 months ago
On Non-Utilization Bounds for Arbitrary Fixed Priority Policies
Prior research on schedulability bounds focused primarily on bounding utilization as a means to meet deadline constraints. Non-trivial bounds were found for a handful of schedulin...
Xue Liu, Tarek F. Abdelzaher
DAC
1997
ACM
13 years 11 months ago
Static Timing Analysis of Embedded Software
This paper examines the problem of statically analyzing the performance of embedded software. This problem is motivated by the increasing growth of embedded systems and a lack of ...
Sharad Malik, Margaret Martonosi, Yau-Tsun Steven ...
STOC
2009
ACM
182views Algorithms» more  STOC 2009»
14 years 8 months ago
Approximating edit distance in near-linear time
We show how to compute the edit distance between two strings of length n up to a factor of 2 ~O( log n) in n1+o(1) time. This is the first sub-polynomial approximation algorithm f...
Alexandr Andoni, Krzysztof Onak