12183 search results - page 2188 / 2437 » Computers under Attacks! |
172
click to vote
COCO
2009
Springer
16 years 1 months ago
2009
Springer
We prove two main results on how arbitrary linear threshold functions f(x) = sign(w · x − θ) over the n-dimensional Boolean hypercube can be approximated by simple threshold f...
158
click to vote
COMPLEX
2009
Springer
16 years 1 months ago
2009
Springer
By introducing and analyzing a renormalization procedure, Song et al. [1] draw the conclusion that many complex networks exhibit self-repeating patterns on all length scales. First...
182
click to vote
COMPLEX
2009
Springer
16 years 1 months ago
2009
Springer
We introduce transformations from time series data to the domain of complex networks which allow us to characterise the dynamics underlying the time series in terms of topological ...
176
click to vote
CONCUR
2009
Springer
16 years 1 months ago
2009
Springer
Bisimulation equivalence is decidable in polynomial time for both sequential and commutative normed context-free processes, known as BPA and BPP, respectively. Despite apparent sim...
161
click to vote
EMMCVPR
2009
Springer
16 years 1 months ago
2009
Springer
Optimization with graph cuts became very popular in recent years. As more applications rely on graph cuts, different energy functions are being employed. Recent evaluation of optim...