Sciweavers

3757 search results - page 316 / 752
» The overlap number of a graph
Sort
View
COCOA
2008
Springer
15 years 8 months ago
Computational Study on Dominating Set Problem of Planar Graphs
Abstract: Recently, there have been significant theoretical progresses towards fixed-parameter algorithms for the DOMINATING SET problem of planar graphs. It is known that the prob...
Marjan Marzban, Qian-Ping Gu, Xiaohua Jia
BMCBI
2010
96views more  BMCBI 2010»
15 years 6 months ago
ChIPpeakAnno: a Bioconductor package to annotate ChIP-seq and ChIP-chip data
Background: Chromatin immunoprecipitation (ChIP) followed by high-throughput sequencing (ChIP-seq) or ChIP followed by genome tiling array analysis (ChIP-chip) have become standar...
Lihua J. Zhu, Claude Gazin, Nathan D. Lawson, Herv...
CVPR
2003
IEEE
16 years 8 months ago
Object Segmentation Using Graph Cuts Based Active Contours
In this paper we present a graph cuts based active contours (GCBAC) approach to object segmentation problems. Our method is a combination of active contours and the optimization t...
Ning Xu, Ravi Bansal, Narendra Ahuja
ICDE
2005
IEEE
156views Database» more  ICDE 2005»
16 years 8 months ago
Reverse Nearest Neighbors in Large Graphs
A reverse nearest neighbor (RNN) query returns the data objects that have a query point as their nearest neighbor (NN). Although such queries have been studied quite extensively in...
Man Lung Yiu, Dimitris Papadias, Nikos Mamoulis, Y...
ICDE
2003
IEEE
170views Database» more  ICDE 2003»
16 years 8 months ago
Keyword Proximity Search on XML Graphs
XKeyword provides efficient keyword proximity queries on large XML graph databases. A query is simply a list of keywords and does not require any schema or query language knowledg...
Vagelis Hristidis, Yannis Papakonstantinou, Andrey...