Sciweavers

172 search results - page 28 / 35
» Planar Graphs with Topological Constraints
Sort
View
CVPR
2011
IEEE
14 years 1 months ago
Entropy Rate Superpixel Segmentation
We propose a new objective function for superpixel segmentation. This objective function consists of two components: entropy rate of a random walk on a graph and a balancing term....
Ming-Yu Liu, Oncel Tuzel, Srikumar Ramalingam, Ram...
VISUALIZATION
2005
IEEE
15 years 3 months ago
Topology-driven Surface Mappings with Robust Feature Alignment
Topological concepts and techniques have been broadly applied in computer graphics and geometric modeling. However, the homotopy type of a mapping between two surfaces has not bee...
Christopher Carner, Miao Jin, Xianfeng Gu, Hong Qi...
ISPD
1999
ACM
112views Hardware» more  ISPD 1999»
15 years 1 months ago
Arbitrary convex and concave rectilinear block packing using sequence-pair
The sequence-pair was proposed in 1994 as a representation of the packing of rectangles of general structure. Since then, there have been e orts to expand its applicability over s...
Kunihiro Fujiyoshi, Hiroshi Murata
78
Voted
SIGGRAPH
1994
ACM
15 years 1 months ago
Using particles to sample and control implicit surfaces
We present a new particle-based approach to sampling and controlling implicit surfaces. A simple constraint locks a set of particles onto a surface while the particles and the sur...
Andrew P. Witkin, Paul S. Heckbert
67
Voted
ECBS
2008
IEEE
86views Hardware» more  ECBS 2008»
15 years 4 months ago
A Formal Model for Network-Wide Security Analysis
Network designers perform challenging tasks with so many configuration options that it is often hard or even impossible for a human to predict all potentially dangerous situation...
Petr Matousek, Jaroslav Ráb, Ondrej Rysavy,...