Sciweavers

361 search results - page 30 / 73
» Algorithms for Extracting Timeliness Graphs
Sort
View
CIKM
2009
Springer
14 years 18 days ago
Efficient processing of group-oriented connection queries in a large graph
We study query processing in large graphs that are fundamental data model underpinning various social networks and Web structures. Given a set of query nodes, we aim to find the g...
James Cheng, Yiping Ke, Wilfred Ng
CN
2007
108views more  CN 2007»
13 years 8 months ago
On the peninsula phenomenon in web graph and its implications on web search
Web masters usually place certain web pages such as home pages and index pages in front of others. Under such a design, it is necessary to go through some pages to reach the desti...
Tao Meng, Hong-Fei Yan
MICCAI
2010
Springer
13 years 7 months ago
Morphology-Guided Graph Search for Untangling Objects: C. elegans Analysis
We present a novel approach for extracting cluttered objects based on their morphological properties1 . Specifically, we address the problem of untangling C. elegans clusters in h...
Tammy Riklin Raviv, Vebjorn Ljosa, Annie L. Conery...
WADS
2001
Springer
86views Algorithms» more  WADS 2001»
14 years 1 months ago
Practical Approximation Algorithms for Separable Packing Linear Programs
Abstract. We describe fully polynomial time approximation schemes for generalized multicommodity flow problems arising in VLSI applications such as Global Routing via Buffer Block...
Feodor F. Dragan, Andrew B. Kahng, Ion I. Mandoiu,...
WWW
2006
ACM
14 years 9 months ago
Using graph matching techniques to wrap data from PDF documents
Wrapping is the process of navigating a data source, semiautomatically extracting data and transforming it into a form suitable for data processing applications. There are current...
Tamir Hassan, Robert Baumgartner