Sciweavers

942 search results - page 134 / 189
» Constraints in Graph Drawing Algorithms
Sort
View
UIST
2004
ACM
14 years 3 months ago
Hierarchical parsing and recognition of hand-sketched diagrams
A long standing challenge in pen-based computer interaction is the ability to make sense of informal sketches. A main difficulty lies in reliably extracting and recognizing the i...
Levent Burak Kara, Thomas F. Stahovich
CP
2005
Springer
14 years 3 months ago
Automatic Detection of Variable and Value Symmetries
Abstract. Many symmetry breaking techniques assume that the symmetries of a CSP are given as input in addition to the CSP itself. We present a method that can be used to detect all...
Jean-Francois Puget
WSCG
2004
164views more  WSCG 2004»
13 years 11 months ago
Constrained Visualization of 2D Positive Data using Modified Quadratic Shepard Method
This paper is about the visualization of positive data subject to positivity constraint. It presents an algorithm that produces a non-negative graph through scattered positive dat...
Muhammed Rafiq Asim, Ghulam Mustafa, Ken Brodlie
CVPR
2001
IEEE
14 years 12 months ago
Understanding Popout through Repulsion
Perceptual popout is defined by both feature similarity and local feature contrast. We identify these two measures with attraction and repulsion, and unify the dual processes of a...
Stella X. Yu, Jianbo Shi
SAS
2004
Springer
103views Formal Methods» more  SAS 2004»
14 years 3 months ago
A Scalable Nonuniform Pointer Analysis for Embedded Programs
Abstract. In this paper we present a scalable pointer analysis for embedded applications that is able to distinguish between instances of recursively defined data structures and e...
Arnaud Venet