Sciweavers

646 search results - page 98 / 130
» Generalized connected domination in graphs
Sort
View
IWOCA
2009
Springer
157views Algorithms» more  IWOCA 2009»
14 years 3 months ago
Forbidden Subgraph Colorings and the Oriented Chromatic Number
: We present an improved upper bound of O(d1+ 1 m−1 ) for the (2, F)-subgraph chromatic number χ2,F (G) of any graph G of maximum degree d. Here, m denotes the minimum number of...
N. R. Aravind, C. R. Subramanian
TOG
2008
200views more  TOG 2008»
13 years 8 months ago
Improved seam carving for video retargeting
Video, like images, should support content aware resizing. We present video retargeting using an improved seam carving operator. Instead of removing 1D seams from 2D images we rem...
Michael Rubinstein, Ariel Shamir, Shai Avidan
CORR
2007
Springer
130views Education» more  CORR 2007»
13 years 8 months ago
Lagrangian Relaxation for MAP Estimation in Graphical Models
Abstract— We develop a general framework for MAP estimation in discrete and Gaussian graphical models using Lagrangian relaxation techniques. The key idea is to reformulate an in...
Jason K. Johnson, Dmitry M. Malioutov, Alan S. Wil...
WWW
2005
ACM
14 years 9 months ago
On the lack of typical behavior in the global Web traffic network
We offer the first large-scale analysis of Web traffic based on network flow data. Using data collected on the Internet2 network, we constructed a weighted bipartite clientserver ...
Mark Meiss, Filippo Menczer, Alessandro Vespignani
INFOCOM
2005
IEEE
14 years 2 months ago
Gossip algorithms: design, analysis and applications
Abstract— Motivated by applications to sensor, peer-topeer and ad hoc networks, we study distributed asynchronous algorithms, also known as gossip algorithms, for computation and...
Stephen P. Boyd, Arpita Ghosh, Balaji Prabhakar, D...