Sciweavers

Share
116 search results - page 1 / 24
» Polynomial-time solution of change detection problems
Sort
View
CDC
2009
IEEE
156views Control Systems» more  CDC 2009»
8 years 9 months ago
Polynomial-time solution of change detection problems
Change detection problems are ubiquitous, but there are no existing tractable techniques for -exact solution of discrete-time, discrete-observation problems. A polynomialtime algor...
Joshua D. Isom, Robert E. LaBarre, Richard D. Braa...
DSN
2008
IEEE
9 years 6 months ago
Anomaly? application change? or workload change? towards automated detection of application performance anomaly and change
: Automated tools for understanding application behavior and its changes during the application life-cycle are essential for many performance analysis and debugging tasks. Applicat...
Ludmila Cherkasova, Kivanc M. Ozonat, Ningfang Mi,...
ADAEUROPE
2007
Springer
9 years 6 months ago
Static Detection of Livelocks in Ada Multitasking Programs
Abstract. In this paper we present algorithms to statically detect livelocks in Ada multitasking programs. Although the algorithms’ worst-case execution time is exponential, they...
Johann Blieberger, Bernd Burgstaller, Robert Mitte...
CVPR
2010
IEEE
9 years 8 months ago
The Cluttered Background Problem for Active Contours: A Minimum-Latency Solution
We present a region-based active contour detection algorithm for objects that exhibit relatively homogeneous photometric characteristics (e.g. smooth color or gray levels), embedd...
Stefano Soatto, Ganesh Sundaramoorthi, Anthony Yez...
ICCAD
1994
IEEE
106views Hardware» more  ICCAD 1994»
9 years 4 months ago
On the NP-completeness of regular 2-D FPGA routing architectures and a novel solution
Several industrial FPGA routing architectures have been shown to have no efficient routing algorithms (unless P=NP) [3,4]. Here, we further investigate if the intractability of th...
Yu-Liang Wu, Douglas Chang
books