Sciweavers

116 search results - page 2 / 24
» Beyond Graphs: A New Synthesis.
Sort
View
ICCV
2009
IEEE
1714views Computer Vision» more  ICCV 2009»
14 years 9 months ago
Power watersheds: a new image segmentation framework extending graph cuts, random walker and optimal spanning forest
In this work, we extend a common framework for seeded image segmentation that includes the graph cuts, ran- dom walker, and shortest path optimization algorithms. Viewing an ima...
Camille Couprie, Leo Grady, Laurent Najman, Hugues...
SIGCOMM
2009
ACM
13 years 11 months ago
Beyond friendship graphs: a study of user interactions in Flickr
Most of the existing literature on empirical studies of Online Social Networks (OSNs) have focused on characterizing and modeling the structure of their inferred friendship graphs...
Masoud Valafar, Reza Rejaie, Walter Willinger
GLVLSI
2007
IEEE
167views VLSI» more  GLVLSI 2007»
13 years 11 months ago
A new approach to logic synthesis of multi-output boolean functions on pal-based CPLDS
A PAL-based logic block is the core of great majority of contemporary CPLD devices. The purpose of the paper is to present a new approach to multi-level synthesis for PAL-based CP...
Dariusz Kania
ICCD
2008
IEEE
151views Hardware» more  ICCD 2008»
14 years 1 months ago
Digital filter synthesis considering multiple adder graphs for a coefficient
—In this paper, a new FIR digital filter synthesis algorithm is proposed to consider multiple adder graphs for a coefficient. The proposed algorithm selects an adder graph that c...
Jeong-Ho Han, In-Cheol Park
CVPR
2010
IEEE
14 years 1 months ago
Beyond Trees: MRF Inference via Outer-Planar Decomposition
Maximum a posteriori (MAP) inference in Markov Random Fields (MRFs) is an NP-hard problem, and thus research has focussed on either finding efficiently solvable subclasses (e.g. t...
Dhruv Batra, Andrew Gallagher, Devi Parikh, Tsuhan...