Sciweavers

488 search results - page 79 / 98
» Automorphic Decompositions of Graphs
Sort
View
DAC
2009
ACM
16 years 6 months ago
Mode grouping for more effective generalized scheduling of dynamic dataflow applications
For a number of years, dataflow concepts have provided designers of digital signal processing systems with environments capable of expressing high-level software architectures as ...
William Plishker, Nimish Sane, Shuvra S. Bhattacha...
COCOON
2005
Springer
15 years 10 months ago
Genome Rearrangements with Partially Ordered Chromosomes
Genomic maps often do not specify the order within some groups of two or more markers. The synthesis of a master map from several sources introduces additional order ambiguity due ...
Chunfang Zheng, David Sankoff
ACMACE
2008
ACM
15 years 7 months ago
Extracting camera-control requirements and camera movement generation in a 3D virtual environment
This paper proposes a new method to generate smooth camera movement that is collision-free in a three-dimensional virtual environment. It generates a set of cells based on cell de...
Hirofumi Hamazaki, Shinya Kitaoka, Maya Ozaki, Yos...
ACSC
2009
IEEE
15 years 12 months ago
A ConceptLink Graph for Text Structure Mining
Most text mining methods are based on representing documents using a vector space model, commonly known as a bag of word model, where each document is modeled as a linear vector r...
Rowena Chau, Ah Chung Tsoi, Markus Hagenbuchner, V...
KDD
2008
ACM
165views Data Mining» more  KDD 2008»
16 years 5 months ago
Colibri: fast mining of large static and dynamic graphs
Low-rank approximations of the adjacency matrix of a graph are essential in finding patterns (such as communities) and detecting anomalies. Additionally, it is desirable to track ...
Hanghang Tong, Spiros Papadimitriou, Jimeng Sun, P...