Sciweavers

1646 search results - page 143 / 330
» fast 2007
Sort
View
AUSDM
2007
Springer
145views Data Mining» more  AUSDM 2007»
15 years 10 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...
ECRTS
2007
IEEE
15 years 10 months ago
WCET-Directed Dynamic Scratchpad Memory Allocation of Data
Many embedded systems feature processors coupled with a small and fast scratchpad memory. To the difference with caches, allocation of data to scratchpad memory must be handled by...
Jean-François Deverge, Isabelle Puaut
ICRA
2007
IEEE
155views Robotics» more  ICRA 2007»
15 years 10 months ago
Swept Volume approximation of polygon soups
— We present a fast GPU-based algorithm to approximate the Swept Volume (SV) boundary of arbitrary polygon soup models. Despite the extensive research on calculating the volume s...
Jesse C. Himmelstein, Etienne Ferre, Jean-Paul Lau...
SASO
2007
IEEE
15 years 10 months ago
Desynchronization: The Theory of Self-Organizing Algorithms for Round-Robin Scheduling
The study of synchronization has received much attention in a variety of applications, ranging from coordinating sensors in wireless networks to models of fireflies flashing in...
Ankit Patel, Julius Degesys, Radhika Nagpal
SSD
2007
Springer
116views Database» more  SSD 2007»
15 years 10 months ago
Continuous Constraint Query Evaluation for Spatiotemporal Streams
In this paper we study the evaluation of continuous constraint queries (CCQs) for spatiotemporal streams. A CCQ triggers an alert whenever a configuration of constraints between s...
Marios Hadjieleftheriou, Nikos Mamoulis, Yufei Tao