Sciweavers

941 search results - page 80 / 189
» Efficient Testing of Large Graphs
Sort
View
BMCBI
2010
124views more  BMCBI 2010»
14 years 10 months ago
Estimation and efficient computation of the true probability of recurrence of short linear protein sequence motifs in unrelated
Background: Large datasets of protein interactions provide a rich resource for the discovery of Short Linear Motifs (SLiMs) that recur in unrelated proteins. However, existing met...
Norman E. Davey, Richard J. Edwards, Denis C. Shie...
GD
2004
Springer
15 years 3 months ago
Clustering Cycles into Cycles of Clusters
In this paper we study simple families of clustered graphs that are highly unconnected. We start by studying 3-cluster cycles, which are clustered graphs such that the underlying ...
Pier Francesco Cortese, Giuseppe Di Battista, Maur...
CONTEXT
2007
Springer
15 years 4 months ago
Context Modeling: Context as a Dressing of a Focus
Contextual Graphs are a context-based formalism used in various real-world applications. They allow a uniform representation of elements of reasoning and of contexts for describing...
Juliette Brézillon, Patrick Brézillo...
CORR
2002
Springer
96views Education» more  CORR 2002»
14 years 9 months ago
Models and Tools for Collaborative Annotation
The Annotation Graph Toolkit (AGTK) is a collection of software which facilitates development of linguistic annotation tools. AGTK provides a database interface which allows appli...
Xiaoyi Ma, Haejoong Lee, Steven Bird, Kazuaki Maed...
ICIP
2010
IEEE
14 years 7 months ago
Image partitioning with kernel mapping and graph cuts
A novel multiregion graph cut image partitioning method combined with kernel mapping is presented. A kernel function transforms implicitly the image data into data of a higher dim...
Mohamed Ben Salah, Amar Mitiche, Ismail Ben Ayed