COMPLEX
2009
Springer
14 years 7 months ago
2009
Springer
In this paper, we present our ongoing work on developing a framework for detecting time-varying communities on human mobile networks. We define the term community in environments ...
COMPLEX
2009
Springer
14 years 7 months ago
2009
Springer
To probe network characteristics, two predominant ways of network comparison are global property statistics and subgraph enumeration. However, they suffer from limited information...
COMPLEX
2009
Springer
14 years 7 months ago
2009
Springer
This paper presents a stochastic multi-agent model of stock market. The market dynamics include switches between chartists and fundamentalists and switches in the prevailing opinio...
COCO
2009
Springer
14 years 7 months ago
2009
Springer
—The Berman-Hartmanis conjecture states that all NP-complete sets are P-isomorphic each other. On this conjecture, we first improve the result of [3] and show that all NP-comple...
COCO
2009
Springer
14 years 7 months ago
2009
Springer
We study the inapproximability of Vertex Cover and Independent Set on degree d graphs. We prove that: • Vertex Cover is Unique Games-hard to approximate to within a factor 2−(...
COCO
2009
Springer
14 years 7 months ago
2009
Springer
—We show that the rank of a depth-3 circuit (over any field) that is simple, minimal and zero is at most O(k3 log d). The previous best rank bound known was 2O(k2 ) (log d)k−2...
COCO
2009
Springer
14 years 7 months ago
2009
Springer
—A simple averaging argument shows that given a randomized algorithm A and a function f such that for every input x, Pr[A(x) = f(x)] ≥ 1−ρ (where the probability is over the...
COCO
2009
Springer
14 years 7 months ago
2009
Springer
Locally testable codes (LTCs) are error-correcting codes for which membership, in the code, of a given word can be tested by examining it in very few locations. Most known constru...
COCO
2009
Springer
14 years 7 months ago
2009
Springer
COCO
2009
Springer
14 years 7 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...