Sciweavers

2283 search results - page 213 / 457
» Bounds of Graph Characteristics
Sort
View
ICRA
2010
IEEE
170views Robotics» more  ICRA 2010»
13 years 6 months ago
Categorizing object-action relations from semantic scene graphs
— In this work we introduce a novel approach for detecting spatiotemporal object-action relations, leading to both, action recognition and object categorization. Semantic scene g...
Eren Erdal Aksoy, Alexey Abramov, Florentin Wö...
CVPR
2011
IEEE
13 years 4 months ago
Nonparametric Density Estimation on A Graph: Learning Framework, Fast Approximation and Application in Image Segmentation
We present a novel framework for tree-structure embedded density estimation and its fast approximation for mode seeking. The proposed method could find diverse applications in co...
Zhiding Yu, Oscar Au, Ketan Tang
APPROX
2004
Springer
135views Algorithms» more  APPROX 2004»
14 years 1 months ago
The Diameter of Randomly Perturbed Digraphs and Some Applications.
The central observation of this paper is that if ǫn random arcs are added to any n-node strongly connected digraph with bounded degree then the resulting graph has diameter O(ln ...
Abraham Flaxman, Alan M. Frieze
ASPDAC
2006
ACM
91views Hardware» more  ASPDAC 2006»
14 years 2 months ago
Fast substrate noise-aware floorplanning with preference directed graph for mixed-signal SOCs
— In this paper, we introduce a novel substrate noise estimation technique during early floorplanning, based on the concept of Block Preference Directed Graph (BPDG) and the cla...
Minsik Cho, Hongjoong Shin, David Z. Pan
ISVC
2010
Springer
13 years 6 months ago
Computer-Generated Tie-Dyeing Using a 3D Diffusion Graph
Abstract. Hand dyeing generates artistic representations with unique and complex patterns. The aesthetics of dyed patterns on a cloth originate from the physical properties of dyei...
Yuki Morimoto, Kenji Ono