Sciweavers

1632 search results - page 153 / 327
» On special numberings of hypergraphs
Sort
View
ANOR
2005
160views more  ANOR 2005»
15 years 6 months ago
Packing r-Cliques in Weighted Chordal Graphs
In Hell et al. (2004), we have previously observed that, in a chordal graph G, the maximum number of independent r-cliques (i.e., of vertex disjoint subgraphs of G, each isomorphic...
Pavol Hell, Sulamita Klein, Loana Tito Nogueira, F...
KAIS
2011
129views more  KAIS 2011»
15 years 1 months ago
Counting triangles in real-world networks using projections
Triangle counting is an important problem in graph mining. Two frequently used metrics in complex network analysis which require the count of triangles are the clustering coefficie...
Charalampos E. Tsourakakis
SIAMCOMP
1998
114views more  SIAMCOMP 1998»
15 years 6 months ago
Universal Limit Laws for Depths in Random Trees
Random binary search trees, b-ary search trees, median-of-(2k+1) trees, quadtrees, simplex trees, tries, and digital search trees are special cases of random split trees. For these...
Luc Devroye
RECOMB
2005
Springer
16 years 6 months ago
RNA-RNA Interaction Prediction and Antisense RNA Target Search
Abstract. Recent studies demonstrating the existence of special non-coding "antisense" RNAs used in post-transcriptional gene regulation have received considerable attent...
Can Alkan, Emre Karakoç, Joseph H. Nadeau, ...
SIGMOD
2007
ACM
153views Database» more  SIGMOD 2007»
16 years 6 months ago
Scaling games to epic proportion
We introduce scalability for computer games as the next frontier for techniques from data management. A very important aspect of computer games is the artificial intelligence (AI)...
Walker M. White, Alan J. Demers, Christoph Koch, J...