Sciweavers

400 search results - page 39 / 80
» On some Properties of DNA Graphs
Sort
View
KDD
2005
ACM
140views Data Mining» more  KDD 2005»
14 years 8 months ago
Graphs over time: densification laws, shrinking diameters and possible explanations
How do real graphs evolve over time? What are "normal" growth patterns in social, technological, and information networks? Many studies have discovered patterns in stati...
Jure Leskovec, Jon M. Kleinberg, Christos Faloutso...
CAIP
2005
Springer
160views Image Analysis» more  CAIP 2005»
14 years 1 months ago
Supervised Texture Detection in Images
This paper presents a technique for texture segmentation in images. Providing a small template of a texture of interest results in the image being segmented into regions with simil...
Branislav Micusík, Allan Hanbury
EACL
1993
ACL Anthology
13 years 9 months ago
Towards efficient parsing with proof-nets
This paper presents a method for parsing associative Lambek grammars based on graphtheoretic properties. Connection graphs, which are a simplified version of proof-nets, are actua...
Alain Lecomte
CMOT
2004
141views more  CMOT 2004»
13 years 7 months ago
Small Worlds Among Interlocking Directors: Network Structure and Distance in Bipartite Graphs
We describe a methodology to examine bipartite relational data structures as exemplified in networks of corporate interlocking. These structures can be represented as bipartite gr...
Garry Robins, Malcolm Alexander
APPROX
2011
Springer
242views Algorithms» more  APPROX 2011»
12 years 8 months ago
New Tools for Graph Coloring
How to color 3 colorable graphs with few colors is a problem of longstanding interest. The best polynomial-time algorithm uses n0.2072 colors. There are no indications that colori...
Sanjeev Arora, Rong Ge