Sciweavers

6740 search results - page 165 / 1348
» An s -Hamiltonian Line Graph Problem
Sort
View
COCOA
2009
Springer
14 years 3 months ago
Linear Coherent Bi-cluster Discovery via Line Detection and Sample Majority Voting
Discovering groups of genes that share common expression profiles is an important problem in DNA microarray analysis. Unfortunately, standard bi-clustering algorithms often fail t...
Yi Shi, Zhipeng Cai, Guohui Lin, Dale Schuurmans
COMPGEOM
2007
ACM
14 years 2 months ago
Streaming algorithms for line simplification
We study the following variant of the well-known line-simplification problem: we are getting a possibly infinite sequence of points p0, p1, p2, . . . in the plane defining a polyg...
Mohammad Ali Abam, Mark de Berg, Peter Hachenberge...
SPIRE
2000
Springer
14 years 1 months ago
Fully Compressed Pattern Matching Algorithm for Balanced Straight-Line Programs
We consider a fully compressed pattern matching problem, where both text T and pattern P are given by its succinct representation, in terms of straight-line programs and its varia...
Masahiro Hirao, Ayumi Shinohara, Masayuki Takeda, ...
MST
2011
207views Hardware» more  MST 2011»
13 years 5 months ago
Fixpoint Logics over Hierarchical Structures
Hierarchical graph definitions allow a modular description of graphs using modules for the specification of repeated substructures. Beside this modularity, hierarchical graph de...
Stefan Göller, Markus Lohrey
COMPGEOM
2009
ACM
14 years 4 months ago
Randomly removing g handles at once
It was shown in [11] that any orientable graph of genus g can be probabilistically embedded into a graph of genus g − 1 with constant distortion. Removing handles one by one giv...
Glencora Borradaile, James R. Lee, Anastasios Sidi...