Sciweavers

419 search results - page 73 / 84
» Using Matrix Decompositions in Formal Concept Analysis
Sort
View
EVOW
2005
Springer
14 years 1 months ago
Order Preserving Clustering over Multiple Time Course Experiments
Abstract. Clustering still represents the most commonly used technique to analyze gene expression data—be it classical clustering approaches that aim at finding biologically rel...
Stefan Bleuler, Eckart Zitzler
ALMOB
2007
129views more  ALMOB 2007»
13 years 7 months ago
Consistency of the Neighbor-Net Algorithm
Background: Neighbor-Net is a novel method for phylogenetic analysis that is currently being widely used in areas such as virology, bacteriology, and plant evolution. Given an inp...
David Bryant, Vincent Moulton, Andreas Spillner
COCO
2009
Springer
105views Algorithms» more  COCO 2009»
14 years 2 months ago
Planar Graph Isomorphism is in Log-Space
Graph Isomorphism is the prime example of a computational problem with a wide difference between the best known lower and upper bounds on its complexity. There is a significant ...
Samir Datta, Nutan Limaye, Prajakta Nimbhorkar, Th...
SOUPS
2009
ACM
14 years 2 months ago
A user study of the expandable grid applied to P3P privacy policy visualization
Displaying website privacy policies to consumers in ways they understand is an important part of gaining consumers’ trust and informed consent, yet most website privacy policies...
Robert W. Reeder, Patrick Gage Kelley, Aleecia M. ...
MMB
2010
Springer
194views Communications» more  MMB 2010»
14 years 13 days ago
Searching for Tight Performance Bounds in Feed-Forward Networks
Abstract. Computing tight performance bounds in feed-forward networks under general assumptions about arrival and server models has turned out to be a challenging problem. Recently...
Andreas Kiefer, Nicos Gollan, Jens B. Schmitt