Sciweavers

6274 search results - page 243 / 1255
» From query complexity to computational complexity
Sort
View
ECBS
1999
IEEE
112views Hardware» more  ECBS 1999»
15 years 9 months ago
Metaprogrammable Toolkit for Model-Integrated Computing
Model-Integrated Computing, specifically Model-Integrated Program Synthesis (MIPS) environments that include visual model building, constraint management, and automatic program sy...
Ákos Lédeczi, Miklos Maroti, Gabor K...
BIB
2007
108views more  BIB 2007»
15 years 5 months ago
Bayesian methods in bioinformatics and computational systems biology
Bayesian methods are valuable, inter alia, whenever there is a need to extract information from data that is uncertain or subject to any kind of error or noise (including measurem...
Darren J. Wilkinson
140
Voted
CIE
2006
Springer
15 years 8 months ago
On Graph Isomorphism for Restricted Graph Classes
Abstract. Graph isomorphism (GI) is one of the few remaining problems in NP whose complexity status couldn't be solved by classifying it as being either NP-complete or solvabl...
Johannes Köbler
ICASSP
2008
IEEE
15 years 11 months ago
Fast query by example of environmental sounds via robust and efficient cluster-based indexing
There has been much recent progress in the technical infrastructure necessary to continuously characterize and archive all sounds, or more precisely auditory streams, that occur w...
Jiachen Xue, Gordon Wichern, Harvey D. Thornburg, ...
ICCAD
2005
IEEE
79views Hardware» more  ICCAD 2005»
16 years 1 months ago
The impact of the nanoscale on computing systems
— Nanoscale technologies provide both challenges and opportunities. We show that the issues and potential solutions facing designers are technology independent and arise mainly f...
Seth Copen Goldstein