Sciweavers

611 search results - page 70 / 123
» Querying Tree-Structured Data Using Dimension Graphs
Sort
View
BMCBI
2010
143views more  BMCBI 2010»
13 years 10 months ago
ETE: a python Environment for Tree Exploration
Background: Many bioinformatics analyses, ranging from gene clustering to phylogenetics, produce hierarchical trees as their main result. These are used to represent the relations...
Jaime Huerta-Cepas, Joaquín Dopazo, Toni Ga...
SIGMOD
1997
ACM
160views Database» more  SIGMOD 1997»
14 years 2 months ago
Improved Query Performance with Variant Indexes
: The read-mostly environment of data warehousing makes it possible to use more complex indexes to speed up queries than in situations where concurrent updatesare present. The curr...
Patrick E. O'Neil, Dallan Quass
WSDM
2009
ACM
115views Data Mining» more  WSDM 2009»
14 years 4 months ago
Discovering and using groups to improve personalized search
Personalized Web search takes advantage of information about an individual to identify the most relevant results for that person. A challenge for personalization lies in collectin...
Jaime Teevan, Meredith Ringel Morris, Steve Bush
GIS
2003
ACM
14 years 11 months ago
Computational data modeling for network-constrained moving objects
Advances in wireless communications, positioning technology, and other hardware technologies combine to enable a range of applications that use a mobile user's geo-spatial da...
Laurynas Speicys, Christian S. Jensen, Augustas Kl...
ICDM
2006
IEEE
296views Data Mining» more  ICDM 2006»
14 years 4 months ago
Fast Random Walk with Restart and Its Applications
How closely related are two nodes in a graph? How to compute this score quickly, on huge, disk-resident, real graphs? Random walk with restart (RWR) provides a good relevance scor...
Hanghang Tong, Christos Faloutsos, Jia-Yu Pan