5606 search results - page 212 / 1122 » Randomization Techniques for Graphs. |
120
click to vote
ASPDAC
2008
ACM
15 years 5 months ago
2008
ACM
A two-stage optimization methodology is proposed to solve the fixed-outline floorplanning problem that is a global optimization problem for wirelength minimization. In the first st...
121
Voted
SAMOS
2010
Springer
15 years 2 months ago
2010
Springer
Abstract—In this paper we present a Multithreaded programming methodology for multi-core systems that utilizes DataFlow concurrency. The programmer augments the program with macr...
151
Voted
CSREASAM
2006
15 years 5 months ago
2006
- Data collection mechanism is a crucial factor for the performance of intrusion detection system (IDS). Simple random sampling and Stratified random sampling techniques of statist...
141
Voted
CCS
2010
ACM
15 years 2 months ago
2010
ACM
Social network-based Sybil defenses exploit the trust exhibited in social graphs to detect Sybil nodes that disrupt an algorithmic property (i.e., the fast mixing) in these graphs...
137
Voted
WINE
2009
Springer
15 years 10 months ago
2009
Springer
We argue that users in social networks are strategic in how they post and propagate information. We propose two models — greedy and courteous — and study information propagatio...