2168 search results - page 159 / 434 » Randomized Algorithms and Complexity Theory |
108
Voted
DAC
2003
ACM
16 years 4 months ago
2003
ACM
Structuring and mapping of a Boolean function is an important problem in the design of complex integrated circuits. Libraryaware constructive decomposition offers a solution to th...
287
Voted
Lecture Notes
Comparing systems using measurement, simulation, and queueing models. Common mistakes and how to avoid them, selection of techniques and metrics, art of data presentation, summariz...
114
Voted
WAW
2009
Springer
15 years 10 months ago
2009
Springer
The Modularity-Q measure of community structure is known to falsely ascribe community structure to random graphs, at least when it is naively applied. Although Q is motivated by a ...
168
Voted
CORR
2012
Springer
13 years 11 months ago
2012
Springer
Determinantal point processes (DPPs), which arise in random matrix theory and quantum physics, are natural models for subset selection problems where diversity is preferred. Among...
145
Voted
SODA
2007
ACM
15 years 4 months ago
2007
ACM
We introduce a general method to count and randomly sample unlabeled combinatorial structures. The approach is based on pointing unlabeled structures in an “unbiased” way, i.e...