Sciweavers

2695 search results - page 163 / 539
» The Complexity of Forecast Testing
Sort
View
ESANN
2007
15 years 6 months ago
Adaptive Global Metamodeling with Neural Networks
Due to the scale and computational complexity of current simulation codes, metamodels (or surrogate models) have become indispensable tools for exploring and understanding the desi...
Dirk Gorissen, Wouter Hendrickx, Tom Dhaene
ENTCS
2008
103views more  ENTCS 2008»
15 years 4 months ago
Analyzing Reachability for Some Petri Nets With Fast Growing Markings
Using linear algebraic techniques, we analyse the computational complexity of testing reachability in Petri nets for which markings can grow very fast. This leads to two subclasse...
M. Praveen, Kamal Lodaya
ICASSP
2010
IEEE
14 years 11 months ago
Robust frequency-based Audio Fingerprinting
Pure frequency-based audio fingerprint systems have the capacity of handling very short fingerprints while being highly robust to perturbations such as additive noise or compressi...
Elsa Dupraz, Gaël Richard
JMLR
2012
13 years 7 months ago
Graphlet decomposition of a weighted network
We introduce the graphlet decomposition of a weighted network, which encodes a notion of social information based on social structure. We develop a scalable algorithm, which combi...
Hossein Azari Soufiani, Edo Airoldi
STOC
2009
ACM
133views Algorithms» more  STOC 2009»
16 years 5 months ago
New direct-product testers and 2-query PCPs
The "direct product code" of a function f gives its values on all k-tuples (f(x1), . . . , f(xk)). This basic construct underlies "hardness amplification" in c...
Russell Impagliazzo, Valentine Kabanets, Avi Wigde...