Sciweavers

306 search results - page 47 / 62
» Mining tree queries in a graph
Sort
View
BMCBI
2007
134views more  BMCBI 2007»
13 years 8 months ago
PLAN: a web platform for automating high-throughput BLAST searches and for managing and mining results
Background: BLAST searches are widely used for sequence alignment. The search results are commonly adopted for various functional and comparative genomics tasks such as annotating...
Ji He, Xinbin Dai, Xuechun Zhao
SIGMOD
2008
ACM
191views Database» more  SIGMOD 2008»
14 years 8 months ago
Efficient aggregation for graph summarization
Graphs are widely used to model real world objects and their relationships, and large graph datasets are common in many application domains. To understand the underlying character...
Yuanyuan Tian, Richard A. Hankins, Jignesh M. Pate...
STOC
2005
ACM
135views Algorithms» more  STOC 2005»
14 years 8 months ago
On the bias of traceroute sampling: or, power-law degree distributions in regular graphs
Understanding the graph structure of the Internet is a crucial step for building accurate network models and designing efficient algorithms for Internet applications. Yet, obtaini...
Dimitris Achlioptas, Aaron Clauset, David Kempe, C...
STACS
2001
Springer
14 years 10 days ago
Approximation Algorithms for the Bottleneck Stretch Factor Problem
The stretch factor of a Euclidean graph is the maximum ratio of the distance in the graph between any two points and their Euclidean distance. Given a set S of n points in Rd, we ...
Giri Narasimhan, Michiel H. M. Smid
CIKM
2006
Springer
13 years 11 months ago
A system for query-specific document summarization
There has been a great amount of work on query-independent summarization of documents. However, due to the success of Web search engines query-specific document summarization (que...
Ramakrishna Varadarajan, Vagelis Hristidis