Sciweavers

244 search results - page 29 / 49
» Compressive PCA on Graphs
Sort
View
CORR
2010
Springer
66views Education» more  CORR 2010»
13 years 9 months ago
A Unique "Nonnegative" Solution to an Underdetermined System: from Vectors to Matrices
Abstract--This paper investigates the uniqueness of a nonnegative vector solution and the uniqueness of a positive semidefinite matrix solution to underdetermined linear systems. A...
Meng Wang, Weiyu Xu, Ao Tang
CPM
2004
Springer
87views Combinatorics» more  CPM 2004»
14 years 4 months ago
A Trie-Based Approach for Compacting Automata
We describe a new technique for reducing the number of nodes and symbols in automata based on tries. The technique stems from some results on anti-dictionaries for data compression...
Maxime Crochemore, Chiara Epifanio, Roberto Grossi...
CGF
2008
110views more  CGF 2008»
13 years 11 months ago
Motorcycle Graphs: Canonical Quad Mesh Partitioning
We describe algorithms for canonically partitioning semi-regular quadrilateral meshes into structured submeshes, using an adaptation of the geometric motorcycle graph of Eppstein ...
David Eppstein, Michael T. Goodrich, Ethan Kim, Ra...
APVIS
2011
12 years 11 months ago
An extended evaluation of the readability of tapered, animated, and textured directed-edge representations in node-link graphs
We present the results of a study comparing five directed-edge representations for use in 2D, screen-based node-link diagrams. The goal of this work is to extend the understandin...
Danny Holten, Petra Isenberg, Jarke J. van Wijk, J...
WEA
2007
Springer
116views Algorithms» more  WEA 2007»
14 years 5 months ago
Optimal Edge Deletions for Signed Graph Balancing
The Balanced Subgraph problem (edge deletion variant) asks for a 2-coloring of a graph that minimizes the inconsistencies with given edge labels. It has applications in social netw...
Falk Hüffner, Nadja Betzler, Rolf Niedermeier