Sciweavers

339 search results - page 5 / 68
» Handling dynamic data structures in search based testing
Sort
View
ICDE
2008
IEEE
214views Database» more  ICDE 2008»
14 years 9 months ago
Efficient Online Subsequence Searching in Data Streams under Dynamic Time Warping Distance
Abstract- Data streams of real numbers are generated naturally in many applications. The technology of online subsequence searching in data streams becomes more and more important ...
Mi Zhou, Man Hon Wong
PVLDB
2010
190views more  PVLDB 2010»
13 years 2 months ago
Efficient B-tree Based Indexing for Cloud Data Processing
A Cloud may be seen as a type of flexible computing infrastructure consisting of many compute nodes, where resizable computing capacities can be provided to different customers. T...
Sai Wu, Dawei Jiang, Beng Chin Ooi, Kun-Lung Wu
UAI
2003
13 years 9 months ago
Robust Independence Testing for Constraint-Based Learning of Causal Structure
This paper considers a method that combines ideas from Bayesian learning, Bayesian network inference, and classical hypothesis testing to produce a more reliable and robust test o...
Denver Dash, Marek J. Druzdzel
VLSID
2005
IEEE
131views VLSI» more  VLSID 2005»
14 years 8 months ago
Efficient Space/Time Compression to Reduce Test Data Volume and Testing Time for IP Cores
Abstract-- We present two-dimensional (space/time) compression techniques that reduce test data volume and test application time for scan testing of intellectual property (IP) core...
Lei Li, Krishnendu Chakrabarty, Seiji Kajihara, Sh...
ITC
2003
IEEE
115views Hardware» more  ITC 2003»
14 years 29 days ago
Towards Structural Testing of Superconductor Electronics
Many of the semiconductor technologies are already facing limitations while new-generation data and telecommunication systems are implemented. Although in its infancy, superconduc...
Arun A. Joseph, Hans G. Kerkhoff