Sciweavers

28888 search results - page 100 / 5778
» Computability and complexity in analysis
Sort
View
DEBS
2010
ACM
13 years 12 months ago
Reliable complex event detection for pervasive computing
Complex event processing for pervasive computing must deal with various sources of error. In this paper, we focus on improving complex event detector handling of several types of ...
Dan O'Keeffe, Jean Bacon
DAC
2005
ACM
14 years 9 months ago
Simulation based deadlock analysis for system level designs
In the design of highly complex, heterogeneous, and concurrent systems, deadlock detection and resolution remains an important issue. In this paper, we systematically analyze the ...
Xi Chen, Abhijit Davare, Harry Hsieh, Alberto L. S...
CRV
2005
IEEE
191views Robotics» more  CRV 2005»
14 years 1 months ago
Automated Behavioral Phenotype Detection and Analysis Using Color-Based Motion Tracking
The problem of elucidating the functional significance of genes is a key challenge of modern science. Solving this problem can lead to fundamental advancements across multiple are...
Alan Shimoide, Ilmi Yoon, Megumi Fuse, Holly C. Be...
SIGDOC
2004
ACM
14 years 1 months ago
Changes in scientific articles over two hundred years: a coh-metrix analysis
We analyzed texts from years 1800-2004 from the Philosophical Transactions of the Royal Society of London. Two-thousand-word sections from about 20 articles published at 25-year i...
Michell Bruss, Michael J. Albers, Danielle McNamer...
SIGSOFT
2007
ACM
14 years 8 months ago
Measuring empirical computational complexity
The standard language for describing the asymptotic behavior of algorithms is theoretical computational complexity. We propose a method for describing the asymptotic behavior of p...
Simon Goldsmith, Alex Aiken, Daniel Shawcross Wilk...