Sciweavers

61 search results - page 8 / 13
» On Linear Secret Sharing for Connectivity in Directed Graphs
Sort
View
BIODATAMINING
2008
119views more  BIODATAMINING 2008»
13 years 7 months ago
A survey of visualization tools for biological network analysis
The analysis and interpretation of relationships between biological molecules, networks and concepts is becoming a major bottleneck in systems biology. Very often the pure amount ...
Georgios A. Pavlopoulos, Anna-Lynn Wegener, Reinha...
PAMI
2007
154views more  PAMI 2007»
13 years 6 months ago
Graph Embedding and Extensions: A General Framework for Dimensionality Reduction
—Over the past few decades, a large family of algorithms—supervised or unsupervised; stemming from statistics or geometry theory—has been designed to provide different soluti...
Shuicheng Yan, Dong Xu, Benyu Zhang, HongJiang Zha...
CVPR
2005
IEEE
14 years 9 months ago
Graph Embedding: A General Framework for Dimensionality Reduction
In the last decades, a large family of algorithms supervised or unsupervised; stemming from statistic or geometry theory have been proposed to provide different solutions to the p...
Shuicheng Yan, Dong Xu, Benyu Zhang, HongJiang Zha...
ESA
2006
Springer
137views Algorithms» more  ESA 2006»
13 years 11 months ago
Deciding Relaxed Two-Colorability - A Hardness Jump
A coloring is proper if each color class induces connected components of order one (where the order of a graph is its number of vertices). Here we study relaxations of proper two-c...
Robert Berke, Tibor Szabó
SODA
2008
ACM
127views Algorithms» more  SODA 2008»
13 years 8 months ago
Nondecreasing paths in a weighted graph or: how to optimally read a train schedule
A travel booking office has timetables giving arrival and departure times for all scheduled trains, including their origins and destinations. A customer presents a starting city a...
Virginia Vassilevska