Sciweavers

675 search results - page 90 / 135
» Biased Range Trees
Sort
View
DASFAA
2004
IEEE
158views Database» more  DASFAA 2004»
15 years 2 months ago
A Cost Model for Spatial Intersection Queries on RI-Trees
Abstract. The efficient management of interval sequences represents a core requirement for many temporal and spatial database applications. With the Relational Interval Tree (RI-tr...
Hans-Peter Kriegel, Martin Pfeifle, Marco Pöt...
ESEM
2007
ACM
15 years 24 days ago
Mining Software Evolution to Predict Refactoring
Can we predict locations of future refactoring based on the development history? In an empirical study of open source projects we found that attributes of software evolution data ...
Jacek Ratzinger, Thomas Sigmund, Peter Vorburger, ...
ISMB
2001
15 years 12 days ago
Designing fast converging phylogenetic methods
Abstract: Absolute fast converging phylogenetic reconstruction methods are provably guaranteed to recover the true tree with high probability from sequences that grow only polynomi...
Luay Nakhleh, Usman Roshan, Katherine St. John, Je...
85
Voted
UAI
2000
15 years 11 days ago
The Anchors Hierarchy: Using the Triangle Inequality to Survive High Dimensional Data
This paper is about the use of metric data structures in high-dimensionalor non-Euclidean space to permit cached sufficientstatisticsaccelerationsof learning algorithms. It has re...
Andrew W. Moore
CORR
2010
Springer
142views Education» more  CORR 2010»
14 years 11 months ago
The Accuracy of Tree-based Counting in Dynamic Networks
Tree-based protocols are ubiquitous in distributed systems. They are flexible, they perform generally well, and, in static conditions, their analysis is mostly simple. Under churn...
Supriya Krishnamurthy, John Ardelius, Erik Aurell,...