Sciweavers

1798 search results - page 139 / 360
» A Tree for All Seasons
Sort
View
RECOMB
2006
Springer
14 years 9 months ago
A Sublinear-Time Randomized Approximation Scheme for the Robinson-Foulds Metric
The Robinson-Foulds (RF) metric is the measure most widely used in comparing phylogenetic trees; it can be computed in linear time using Day's algorithm. When faced with the n...
Nicholas D. Pattengale, Bernard M. E. Moret
EDBT
2008
ACM
99views Database» more  EDBT 2008»
14 years 9 months ago
Querying time-series streams
Index trees created using distance based indexing are difficult to maintain online since the distance function involved is often costly to compute. This problem is intensified whe...
Vivekanand Gopalkrishnan
ICDT
2010
ACM
259views Database» more  ICDT 2010»
14 years 6 months ago
Forward-XPath and extended register automata on data-trees
We consider a fragment of XPath named `forward-XPath', which contains all descendant and rightwards sibling axes as well as data equality and inequality tests. The satisfiabi...
Diego Figueira
AINA
2007
IEEE
14 years 3 months ago
A Distributed and Dynamic Data Gathering Protocol for Sensor Networks
In this paper we propose a distributed, self organizing, robust and energy efficient data gathering algorithm for sensor networks operating in environments where all the sensor n...
Hüseyin Özgür Tan, Ibrahim Korpeogl...
CCGRID
2007
IEEE
14 years 3 months ago
High-Performance MPI Broadcast Algorithm for Grid Environments Utilizing Multi-lane NICs
The performance of MPI collective operations, such as broadcast and reduction, is heavily affected by network topologies, especially in grid environments. Many techniques to cons...
Tatsuhiro Chiba, Toshio Endo, Satoshi Matsuoka