Sciweavers

268 search results - page 34 / 54
» Growing Protean Graphs
Sort
View
CIKM
2006
Springer
15 years 5 months ago
On the structural properties of massive telecom call graphs: findings and implications
With ever growing competition in telecommunications markets, operators have to increasingly rely on business intelligence to offer the right incentives to their customers. Toward ...
Amit Anil Nanavati, Siva Gurumurthy, Gautam Das, D...
106
Voted
RSA
2006
104views more  RSA 2006»
15 years 1 months ago
The satisfiability threshold for randomly generated binary constraint satisfaction problems
Abstract. We study two natural models of randomly generated constraint satisfaction problems. We determine how quickly the domain size must grow with n to ensure that these models ...
Alan M. Frieze, Michael Molloy
91
Voted
PADS
1997
ACM
15 years 6 months ago
MRE: A Flexible Approach to Multi-Resolution Modeling
Multi-resolution representation of simulated entities is considered essentialfor a growing portion of distributed simulations. Heretofore,modelers have representedentites at just ...
Anand Natrajan, Paul F. Reynolds Jr., Sudhir Srini...
KES
2006
Springer
15 years 1 months ago
Genetic-Fuzzy Modeling on High Dimensional Spaces
In this paper, in order to reduce the explosive increase of the search space as the input dimension grows, we present a new representation method for the structure of fuzzy rules, ...
Joon-Min Gil, SeongHoon Lee
125
Voted
STOC
2009
ACM
181views Algorithms» more  STOC 2009»
16 years 2 months ago
The detectability lemma and quantum gap amplification
The quantum analog of a constraint satisfaction problem is a sum of local Hamiltonians - each (term of the) Hamiltonian specifies a local constraint whose violation contributes to...
Dorit Aharonov, Itai Arad, Zeph Landau, Umesh V. V...