Sciweavers

719 search results - page 98 / 144
» Adaptive Online Time Allocation to Search Algorithms
Sort
View
AUSDM
2007
Springer
145views Data Mining» more  AUSDM 2007»
15 years 4 months ago
Discovering Frequent Sets from Data Streams with CPU Constraint
Data streams are usually generated in an online fashion characterized by huge volume, rapid unpredictable rates, and fast changing data characteristics. It has been hence recogniz...
Xuan Hong Dang, Wee Keong Ng, Kok-Leong Ong, Vince...
DASFAA
2005
IEEE
157views Database» more  DASFAA 2005»
15 years 3 months ago
Adaptively Detecting Aggregation Bursts in Data Streams
Finding bursts in data streams is attracting much attention in research community due to its broad applications. Existing burst detection methods suffer the problems that 1) the p...
Aoying Zhou, Shouke Qin, Weining Qian
CGO
2004
IEEE
15 years 1 months ago
A Dynamically Tuned Sorting Library
Empirical search is a strategy used during the installation of library generators such as ATLAS, FFTW, and SPIRAL to identify the algorithm or the version of an algorithm that del...
Xiaoming Li, María Jesús Garzar&aacu...
JSS
2007
93views more  JSS 2007»
14 years 9 months ago
Resource management for real-time tasks in mobile robotics
Coordinated behavior of mobile robots is an important emerging application area. Different coordinated behaviors can be achieved by assigning sets of control tasks, or strategies...
Huan Li, Krithi Ramamritham, Prashant J. Shenoy, R...
TVCG
2011
274views more  TVCG 2011»
14 years 4 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...