Sciweavers

2877 search results - page 115 / 576
» The Complexity of Planarity Testing
Sort
View
ICASSP
2010
IEEE
14 years 11 months ago
A low complexity speck-based codec for multispectral fluorescence microscopic images
The distortion scalable wavelet based coder SPECK is widely referred to in literature as achieving excellent coding performance with very low computational complexity compared to ...
Awais Mansoor, J. Paul Robinson, Bartek Rajwa
EUROSYS
2010
ACM
16 years 1 months ago
Splitter: A Proxy-based Approach for Post-Migration Testing of Web Applications
The benefits of virtualized IT environments, such as compute clouds, have drawn interested enterprises to migrate their applications onto new platforms to gain the advantages of ...
Xiaoning Ding, Hai Huang, Yaoping Ruan, Anees Shai...
ICST
2008
IEEE
15 years 10 months ago
Model-Based Testing of Automotive Systems
In recent years the development of automotive embedded devices has changed from an electrical and mechanical engineering discipline to a combination of software and electrical/mec...
Eckard Bringmann, Andreas Krämer
SIAMDM
2008
79views more  SIAMDM 2008»
15 years 4 months ago
Testing Triangle-Freeness in General Graphs
In this paper we consider the problem of testing whether a graph is triangle-free, and more generally, whether it is H-free, for a fixed subgraph H. The algorithm should accept gr...
Noga Alon, Tali Kaufman, Michael Krivelevich, Dana...
STOC
2004
ACM
94views Algorithms» more  STOC 2004»
16 years 4 months ago
Sublinear algorithms for testing monotone and unimodal distributions
The complexity of testing properties of monotone and unimodal distributions, when given access only to samples of the distribution, is investigated. Two kinds of sublineartime alg...
Tugkan Batu, Ravi Kumar, Ronitt Rubinfeld