Sciweavers

2374 search results - page 433 / 475
» Fast Distributed Algorithms for Computing Separable Function...
Sort
View
CGO
2004
IEEE
13 years 11 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...
SIGMOD
2004
ACM
209views Database» more  SIGMOD 2004»
14 years 8 months ago
MAIDS: Mining Alarming Incidents from Data Streams
Real-time surveillance systems, network and telecommunication systems, and other dynamic processes often generate tremendous (potentially infinite) volume of stream data. Effectiv...
Y. Dora Cai, David Clutter, Greg Pape, Jiawei Han,...
SIGCOMM
2006
ACM
14 years 1 months ago
Beyond bloom filters: from approximate membership checks to approximate state machines
Many networking applications require fast state lookups in a concurrent state machine, which tracks the state of a large number of flows simultaneously. We consider the question ...
Flavio Bonomi, Michael Mitzenmacher, Rina Panigrah...
VISUALIZATION
1999
IEEE
14 years 3 days ago
Splatting Without the Blur
Splatting is a volume rendering algorithm that combines efficient volume projection with a sparse data representation: Only voxels that have values inside the iso-range need to be...
Klaus Mueller, Torsten Möller, Roger Crawfis
MOBIDE
2005
ACM
14 years 1 months ago
Towards universal mobile caching
In the context of mobile data access, data caching is fundamental for both performance and functionality. For this reason there have been many studies into developing energy-effi...
Ganesh Santhanakrishnan, Ahmed Amer, Panos K. Chry...