Sciweavers

285 search results - page 19 / 57
» New Ways to Construct Binary Search Trees
Sort
View
TVCG
2011
274views more  TVCG 2011»
14 years 6 months ago
Memory-Scalable GPU Spatial Hierarchy Construction
We present two novel algorithms for constructing spatial hierarchies on GPUs. The first is for kd-trees that automatically balances between the level of parallelism and total mem...
Qiming Hou, Xin Sun, Kun Zhou, Christian Lauterbac...
ICDE
2006
IEEE
167views Database» more  ICDE 2006»
16 years 1 months ago
Better Burst Detection
A burst is a large number of events occurring within a certain time window. As an unusual activity, it's a noteworthy phenomenon in many natural and social processes. Many da...
Xin Zhang, Dennis Shasha
BIOADIT
2004
Springer
15 years 5 months ago
Searching for a Practical Evidence of the No Free Lunch Theorems
Abstract. According to the No Free Lunch (NFL) theorems all blackbox algorithms perform equally well when compared over the entire set of optimization problems. An important proble...
Mihai Oltean
BIRD
2007
Springer
128views Bioinformatics» more  BIRD 2007»
15 years 5 months ago
Efficient and Scalable Indexing Techniques for Biological Sequence Data
We investigate indexing techniques for sequence data, crucial in a wide variety of applications, where efficient, scalable, and versatile search algorithms are required. Recent res...
Mihail Halachev, Nematollaah Shiri, Anand Thamildu...
TFS
2011
194views Education» more  TFS 2011»
14 years 6 months ago
Top-Down Induction of Fuzzy Pattern Trees
Fuzzy pattern tree induction was recently introduced as a novel machine learning method for classification. Roughly speaking, a pattern tree is a hierarchical, tree-like structur...
R. Senge, Eyke Hüllermeier