Sciweavers

646 search results - page 114 / 130
» Generalized connected domination in graphs
Sort
View
KDD
2008
ACM
224views Data Mining» more  KDD 2008»
14 years 9 months ago
The structure of information pathways in a social communication network
Social networks are of interest to researchers in part because they are thought to mediate the flow of information in communities and organizations. Here we study the temporal dyn...
Gueorgi Kossinets, Jon M. Kleinberg, Duncan J. Wat...
VLSID
2002
IEEE
94views VLSI» more  VLSID 2002»
14 years 9 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
OSDI
2008
ACM
14 years 9 months ago
Block Mason
The flexibility provided by hardware virtualization allows administrators to rapidly create, destroy, and migrate systems across physical hosts. Unfortunately, the storage systems...
Dutch T. Meyer, Brendan Cully, Jake Wires, Norman ...
WEA
2010
Springer
330views Algorithms» more  WEA 2010»
14 years 3 months ago
Exact Bipartite Crossing Minimization under Tree Constraints
A tanglegram consists of a pair of (not necessarily binary) trees T1, T2 with leaf sets L1, L2. Additional edges, called tangles, may connect nodes in L1 with those in L2. The task...
Frank Baumann, Christoph Buchheim, Frauke Liers
WEBI
2009
Springer
14 years 3 months ago
From "Dango" to "Japanese Cakes": Query Reformulation Models and Patterns
Understanding query reformulation patterns is a key step towards next generation web search engines: it can help improving users’ web-search experience by predicting their inten...
Paolo Boldi, Francesco Bonchi, Carlos Castillo, Se...