Sciweavers

6274 search results - page 367 / 1255
» From query complexity to computational complexity
Sort
View
CORR
2010
Springer
151views Education» more  CORR 2010»
15 years 5 months ago
Adding a referee to an interconnection network: What can(not) be computed in one round
Abstract—In this paper we ask which properties of a distributed network can be computed from a few amount of local information provided by its nodes. The distributed model we con...
Florent Becker, Martín Matamala, Nicolas Ni...
GLVLSI
2009
IEEE
122views VLSI» more  GLVLSI 2009»
16 years 1 months ago
Enhancing SAT-based sequential depth computation by pruning search space
The sequential depth determines the completeness of bounded model checking in design verification. Recently, a SATbased method is proposed to compute the sequential depth of a de...
Yung-Chih Chen, Chun-Yao Wang
HICSS
2007
IEEE
172views Biometrics» more  HICSS 2007»
16 years 1 months ago
Support for Computer Forensics Examination Planning with Domain Modeling: A Report of One Experiment Trial
In any forensic investigation, planning and analysis activities are required in order to determine what digital media will be seized, what types of information will be sought in t...
Alfred C. Bogen, David A. Dampier, Jeffrey C. Carv...
NIME
2005
Springer
147views Music» more  NIME 2005»
16 years 7 days ago
Toward Direct Brain-Computer Musical Interfaces
Musicians and composers have been using brainwaves as generative sources in music for at least 40 years and the possibility of a brain-computer interface for direct communication ...
Eduardo Reck Miranda, Andrew Brouse
MICRO
2003
IEEE
152views Hardware» more  MICRO 2003»
16 years 22 hour ago
A Systematic Methodology to Compute the Architectural Vulnerability Factors for a High-Performance Microprocessor
Single-event upsets from particle strikes have become a key challenge in microprocessor design. Techniques to deal with these transient faults exist, but come at a cost. Designers...
Shubhendu S. Mukherjee, Christopher T. Weaver, Joe...