Sciweavers

376 search results - page 65 / 76
» Completely connected clustered graphs
Sort
View
VLSID
2002
IEEE
94views VLSI» more  VLSID 2002»
14 years 8 months ago
A Unified Method to Handle Different Kinds of Placement Constraints in Floorplan Design
In floorplan design, it is common that a designer will want to control the positions of some modules in the final packing for various purposes like data path alignment, I/O connec...
Evangeline F. Y. Young, Chris C. N. Chu, M. L. Ho
INFOCOM
2009
IEEE
14 years 2 months ago
Respondent-Driven Sampling for Characterizing Unstructured Overlays
—This paper presents Respondent-Driven Sampling (RDS) as a promising technique to derive unbiased estimates of node properties in unstructured overlay networks such as Gnutella. ...
Amir Hassan Rasti, Mojtaba Torkjazi, Reza Rejaie, ...
AGILE
2009
Springer
210views GIS» more  AGILE 2009»
14 years 2 months ago
Detecting Hotspots in Geographic Networks
We study a point pattern detection problem on networks, motivated by geographical analysis tasks, such as crime hotspot detection. Given a network N (for example, a street, train,...
Kevin Buchin, Sergio Cabello, Joachim Gudmundsson,...
GECCO
2004
Springer
14 years 1 months ago
Real-Coded Bayesian Optimization Algorithm: Bringing the Strength of BOA into the Continuous World
This paper describes a continuous estimation of distribution algorithm (EDA) to solve decomposable, real-valued optimization problems quickly, accurately, and reliably. This is the...
Chang Wook Ahn, Rudrapatna S. Ramakrishna, David E...
PAMI
2007
186views more  PAMI 2007»
13 years 7 months ago
The Medial Scaffold of 3D Unorganized Point Clouds
—We introduce the notion of the medial scaffold, a hierarchical organization of the medial axis of a 3D shape in the form of a graph constructed from special medial curves connec...
Frederic F. Leymarie, Benjamin B. Kimia