Sciweavers

381 search results - page 33 / 77
» Fast Neighbor Joining
Sort
View
EDBT
2004
ACM
126views Database» more  EDBT 2004»
15 years 10 months ago
Spatial Queries in the Presence of Obstacles
Despite the existence of obstacles in many database applications, traditional spatial query processing utilizes the Euclidean distance metric assuming that points in space are dire...
Jun Zhang, Dimitris Papadias, Kyriakos Mouratidis,...
LCN
2005
IEEE
15 years 3 months ago
Fault Tolerant Active Rings for Structured Peer-to-Peer Overlays
Algorithms by which peers join and leave structured overlay networks can be classified as passive or active. Passive topology maintenance relies on periodic background repair of n...
John Risson, Ken Robinson, Tim Moors
ESA
1999
Springer
82views Algorithms» more  ESA 1999»
15 years 2 months ago
Quartet Cleaning: Improved Algorithms and Simulations
A critical step in all quartet methods for constructing evolutionary trees is the inference of the topology for each set of four sequences (i.e. quartet). It is a well–known fact...
Vincent Berry, Tao Jiang, Paul E. Kearney, Ming Li...
CG
2002
Springer
14 years 9 months ago
Improving progressive view-dependent isosurface propagation
Recently, we proposed a new isosurface extraction algorithm that extracts portions of the isosurface in a viewdependent manner by ray casting and propagation. The algorithm casts ...
Zhiyan Liu, Adam Finkelstein, Kai Li
DEBU
2010
128views more  DEBU 2010»
14 years 7 months ago
Designing Database Operators for Flash-enabled Memory Hierarchies
Flash memory affects not only storage options but also query processing. In this paper, we analyze the use of flash memory for database query processing, including algorithms that...
Goetz Graefe, Stavros Harizopoulos, Harumi A. Kuno...