Sciweavers

3032 search results - page 121 / 607
» Complexity of sequences and dynamical systems
Sort
View
INFOCOM
2006
IEEE
14 years 2 months ago
A Quasi-Species Approach for Modeling the Dynamics of Polymorphic Worms
— Polymorphic worms can change their byte sequence as they replicate and propagate, thwarting the traditional signature analysis techniques used by many intrusion detection syste...
Bradley Stephenson, Biplab Sikdar
ISMB
1996
13 years 10 months ago
Finding Genes in DNA Using Decision Trees and Dynamic Programming
This study demonstratesthe use of decision tree classifiers as the basis for a general gene-finding system. The system uses a dynamic programmingalgorithm that. finds the optimal ...
Steven Salzberg, Xin Chen, John Henderson, Kenneth...
CVPR
2006
IEEE
14 years 3 months ago
Recognition of Composite Human Activities through Context-Free Grammar Based Representation
This paper describes a general methodology for automated recognition of complex human activities. The methodology uses a context-free grammar (CFG) based representation scheme to ...
Michael S. Ryoo, J. K. Aggarwal
CAD
2006
Springer
13 years 9 months ago
An efficient, error-bounded approximation algorithm for simulating quasi-statics of complex linkages
Design and analysis of articulated mechanical structures, commonly referred to as linkages, is an integral part of any CAD/CAM system. The most common approaches formulate the pro...
Stephane Redon, Ming C. Lin
ICWS
2010
IEEE
13 years 10 months ago
Script-Based Generation of Dynamic Testbeds for SOA
This paper addresses one of the major problems of SOA software development: the lack of support for testing complex service-oriented systems. The research community has developed v...
Lukasz Juszczyk, Schahram Dustdar