Sciweavers

31 search results - page 4 / 7
» Power-Aware Collective Tree Exploration
Sort
View
ICDM
2008
IEEE
109views Data Mining» more  ICDM 2008»
14 years 1 months ago
Quantitative Association Analysis Using Tree Hierarchies
Association analysis arises in many important applications such as bioinformatics and business intelligence. Given a large collection of measurements over a set of samples, associ...
Feng Pan, Lynda Yang, Leonard McMillan, Fernando P...
TOIS
2002
97views more  TOIS 2002»
13 years 7 months ago
Burst tries: a fast, efficient data structure for string keys
Many applications depend on efficient management of large sets of distinct strings in memory. For example, during index construction for text databases a record is held for each d...
Steffen Heinz, Justin Zobel, Hugh E. Williams
CVDB
2004
ACM
14 years 23 days ago
The PIBE Personalizable Image Browsing Engine
In this paper we describe PIBE, a new Personalizable Image Browsing Engine that allows an effective visual exploration of large image collections combining computer vision and da...
Ilaria Bartolini, Paolo Ciaccia, Marco Patella
ICDCS
2009
IEEE
14 years 4 months ago
REMO: Resource-Aware Application State Monitoring for Large-Scale Distributed Systems
To observe, analyze and control large scale distributed systems and the applications hosted on them, there is an increasing need to continuously monitor performance attributes of ...
Shicong Meng, Srinivas R. Kashyap, Chitra Venkatra...
ESA
2008
Springer
106views Algorithms» more  ESA 2008»
13 years 9 months ago
An Experimental Analysis of Robinson-Foulds Distance Matrix Algorithms
In this paper, we study two fast algorithms--HashRF and PGM-Hashed--for computing the Robinson-Foulds (RF) distance matrix between a collection of evolutionary trees. The RF distan...
Seung-Jin Sul, Tiffani L. Williams