Sciweavers

2463 search results - page 381 / 493
» Rankings of Directed Graphs
Sort
View
NRHM
2008
106views more  NRHM 2008»
13 years 9 months ago
Towards the unification of formats for overlapping markup
Overlapping markup refers to the issue of how to represent data structures more expressive than trees--for example direct acyclic graphs--using markup (meta-)languages which have ...
Paolo Marinelli, Fabio Vitali, Stefano Zacchiroli
PAMI
2008
153views more  PAMI 2008»
13 years 9 months ago
Correlation Metric for Generalized Feature Extraction
Beyond conventional linear and kernel-based feature extraction, we present a more generalized formulation for feature extraction in this paper. Two representative algorithms using ...
Yun Fu, Shuicheng Yan, Thomas S. Huang
MP
2010
99views more  MP 2010»
13 years 7 months ago
Separation, dimension, and facet algorithms for node flow polyhedra
Abstract; Dedicated to Alan J. Hoffman Ball et al. propose a graph model for material compatibility constraints for products such as PCs made from components, where each componen...
Maren Martens, S. Thomas McCormick, Maurice Queyra...
APVIS
2010
13 years 7 months ago
Interactive local clustering operations for high dimensional data in parallel coordinates
In this paper, we propose an approach of clustering data in parallel coordinates through interactive local operations. Different from many other methods in which clustering is glo...
Peihong Guo, He Xiao, Zuchao Wang, Xiaoru Yuan
CASES
2009
ACM
13 years 7 months ago
Spatial complexity of reversibly computable DAG
In this paper we address the issue of making a program reversible in terms of spatial complexity. Spatial complexity is the amount of memory/register locations required for perfor...
Mouad Bahi, Christine Eisenbeis