Sciweavers

87 search results - page 17 / 18
» Limits of dense graph sequences
Sort
View
EOR
2008
106views more  EOR 2008»
13 years 5 months ago
Convergent Lagrangian heuristics for nonlinear minimum cost network flows
We consider the separable nonlinear and strictly convex single-commodity network flow problem (SSCNFP). We develop a computational scheme for generating a primal feasible solution...
Torbjörn Larsson, Johan Marklund, Caroline Ol...
CVPR
2006
IEEE
14 years 7 months ago
Space-Time Video Montage
Conventional video summarization methods focus predominantly on summarizing videos along the time axis, such as building a movie trailer. The resulting video trailer tends to reta...
Hong-Wen Kang, Yasuyuki Matsushita, Xiaoou Tang, X...
BMCBI
2010
176views more  BMCBI 2010»
13 years 5 months ago
Bayesian statistical modelling of human protein interaction network incorporating protein disorder information
Background: We present a statistical method of analysis of biological networks based on the exponential random graph model, namely p2-model, as opposed to previous descriptive app...
Svetlana Bulashevska, Alla Bulashevska, Roland Eil...
CORR
2010
Springer
190views Education» more  CORR 2010»
13 years 5 months ago
Overlap properties of geometric expanders
The overlap number of a finite (d + 1)-uniform hypergraph H is the largest constant c(H) (0, 1] such that no matter how we map the vertices of H into Rd , there is a point covered...
Jacob Fox, Mikhail Gromov, Vincent Lafforgue, Assa...
CHI
2010
ACM
13 years 11 months ago
FrameWire: a tool for automatically extracting interaction logic from paper prototyping tests
Paper prototyping offers unique affordances for interface design. However, due to its spontaneous nature and the limitations of paper, it is difficult to distill and communicate a...
Yang Li, Xiang Cao, Katherine Everitt, Morgan Dixo...