Sciweavers

276 search results - page 12 / 56
» The Complexity of Computing Maximal Word Functions
Sort
View
CHARME
2005
Springer
94views Hardware» more  CHARME 2005»
14 years 1 months ago
Verifying Quantitative Properties Using Bound Functions
Abstract. We define and study a quantitative generalization of the traditional boolean framework of model-based specification and verification. In our setting, propositions have...
Arindam Chakrabarti, Krishnendu Chatterjee, Thomas...
COMPLEX
2009
Springer
14 years 2 months ago
Toward Automatic Discovery of Malware Signature for Anti-Virus Cloud Computing
Security vendors are facing a serious problem of defeating the complexity of malwares. With the popularity and the variety of zeroday malware over the Internet, generating their si...
Wei Yan, Erik Wu
JUCS
2006
107views more  JUCS 2006»
13 years 7 months ago
Testing Membership in Formal Languages Implicitly Represented by Boolean Functions
Abstract: Combinatorial property testing, initiated formally by Goldreich, Goldwasser, and Ron in [Goldreich et al. (1998)] and inspired by Rubinfeld and Sudan in [Rubinfeld and Su...
Beate Bollig
SI3D
2003
ACM
14 years 22 days ago
Interactive navigation in complex environments using path planning
We present a novel approach for interactive navigation in complex 3D synthetic environments using path planning. Our algorithm precomputes a global roadmap of the environment by u...
Brian Salomon, Maxim Garber, Ming C. Lin, Dinesh M...
UC
2009
Springer
14 years 2 months ago
Brain Dynamics Promotes Function
Abstract. Dynamical structure in the brain promotes biological function. Natural scientists look for correlations between measured electrical signals and behavior or mental states....
Carlos Lourenço