Sciweavers

712 search results - page 124 / 143
» On Spectral Graph Drawing
Sort
View
BMCBI
2010
143views more  BMCBI 2010»
13 years 10 months ago
An efficient biological pathway layout algorithm combining grid-layout and spring embedder for complicated cellular location inf
Background: Graph drawing is one of the important techniques for understanding biological regulations in a cell or among cells at the pathway level. Among many available layout al...
Kaname Kojima, Masao Nagasaki, Satoru Miyano
CVPR
2005
IEEE
15 years 3 days ago
Detection and Explanation of Anomalous Activities: Representing Activities as Bags of Event n-Grams
We present a novel representation and method for detecting and explaining anomalous activities in a video stream. Drawing from natural language processing, we introduce a represen...
Raffay Hamid, Amos Y. Johnson, Samir Batta, Aaron ...
PG
2000
IEEE
14 years 2 months ago
Morphing Using Curves and Shape Interpolation Techniques
This paper presents solutions to the feature correspondence and feature interpolation problems in image morphing. The user specifies the correspondence between the source and the...
Henry Johan, Yuichi Koiso, Tomoyuki Nishita
AOSD
2007
ACM
14 years 2 months ago
Efficiently mining crosscutting concerns through random walks
Inspired by our past manual aspect mining experiences, this paper describes a random walk model to approximate how crosscutting concerns can be discovered in the absence of domain...
Charles Zhang, Hans-Arno Jacobsen
ESA
2008
Springer
115views Algorithms» more  ESA 2008»
13 years 12 months ago
A New Approach to Exact Crossing Minimization
The crossing number problem is to find the smallest number of edge crossings necessary when drawing a graph into the plane. Eventhough the problem is NP-hard, we are interested in ...
Markus Chimani, Petra Mutzel, Immanuel M. Bomze