Sciweavers

3265 search results - page 326 / 653
» Representing Groups on Graphs
Sort
View
207
Voted
TVCG
2008
135views more  TVCG 2008»
15 years 6 months ago
Relation-Aware Volume Exploration Pipeline
Volume exploration is an important issue in scientific visualization. Research on volume exploration has been focused on revealing hidden structures in volumetric data. While the i...
Ming-Yuen Chan, Huamin Qu, Ka-Kei Chung, Wai-Ho Ma...
DSS
2002
82views more  DSS 2002»
15 years 6 months ago
On the discovery of process models from their instances
A thorough understanding of the way in which existing business processes currently practice is essential from the perspectives of both process reengineering and workflow managemen...
San-Yih Hwang, Wan-Shiou Yang
MICS
2010
102views more  MICS 2010»
15 years 5 months ago
On Conditional Covering Problem
The conditional covering problem (CCP) aims to locate facilities on a graph, where the vertex set represents both the demand points and the potential facility locations. The proble...
Balasubramanian Sivan, S. Harini, C. Pandu Rangan
ML
2010
ACM
141views Machine Learning» more  ML 2010»
15 years 5 months ago
Relational retrieval using a combination of path-constrained random walks
Scientific literature with rich metadata can be represented as a labeled directed graph. This graph representation enables a number of scientific tasks such as ad hoc retrieval o...
Ni Lao, William W. Cohen
CODES
2010
IEEE
15 years 4 months ago
Worst-case performance analysis of synchronous dataflow scenarios
Synchronous Dataflow (SDF) is a powerful analysis tool for regular, cyclic, parallel task graphs. The behaviour of SDF graphs however is static and therefore not always able to ac...
Marc Geilen, Sander Stuijk