Sciweavers

1805 search results - page 170 / 361
» Functional programming with structured graphs
Sort
View
KDD
2005
ACM
160views Data Mining» more  KDD 2005»
16 years 1 months ago
Consistent bipartite graph co-partitioning for star-structured high-order heterogeneous data co-clustering
Heterogeneous data co-clustering has attracted more and more attention in recent years due to its high impact on various applications. While the co-clustering algorithms for two t...
Bin Gao, Tie-Yan Liu, Xin Zheng, QianSheng Cheng, ...
STOC
2004
ACM
153views Algorithms» more  STOC 2004»
16 years 1 months ago
Quantum and classical query complexities of local search are polynomially related
Let f be an integer valued function on a finite set V . We call an undirected graph G(V, E) a neighborhood structure for f. The problem of finding a local minimum for f can be phr...
Miklos Santha, Mario Szegedy
BMCBI
2005
106views more  BMCBI 2005»
15 years 1 months ago
ESTree db: a Tool for Peach Functional Genomics
Background: The ESTree db http://www.itb.cnr.it/estree/ represents a collection of Prunus persica expressed sequenced tags (ESTs) and is intended as a resource for peach functiona...
Barbara Lazzari, Andrea Caprera, Alberto Vecchiett...
ICFP
2003
ACM
16 years 1 months ago
Scripting the type inference process
To improve the quality of type error messages in functional programming languages, we propose four techniques which influence the behaviour of constraint-based type inference proc...
Bastiaan Heeren, Jurriaan Hage, S. Doaitse Swierst...
STACS
2010
Springer
15 years 8 months ago
Planar Subgraph Isomorphism Revisited
Abstract. The problem of Subgraph Isomorphism is defined as follows: Given a pattern H and a host graph G on n vertices, does G contain a subgraph that is isomorphic to H? Eppstei...
Frederic Dorn