Sciweavers

492 search results - page 30 / 99
» Fast data stream algorithms using associative memories
Sort
View
CLUSTER
2001
IEEE
13 years 11 months ago
Approximation Algorithms for Data Distribution with Load Balancing of Web Servers
Given the increasing traffic on the World Wide Web (Web), it is difficult for a single popular Web server to handle the demand from its many clients. By clustering a group of Web ...
Li-Chuan Chen, Hyeong-Ah Choi
VISUALIZATION
2002
IEEE
14 years 17 days ago
XFastMesh: Fast View-dependent Meshing from External Memory
We present a novel disk-based multiresolution triangle mesh data structure that supports paging and view-dependent rendering of very large meshes at interactive frame rates from e...
Christopher DeCoro, Renato Pajarola
CIDM
2007
IEEE
13 years 7 months ago
SSM : A Frequent Sequential Data Stream Patterns Miner
Data stream applications like sensor network data, click stream data, have data arriving continuously at high speed rates and require online mining process capable of delivering c...
C. I. Ezeife, Mostafa Monwar
CORR
2008
Springer
117views Education» more  CORR 2008»
13 years 7 months ago
A High Performance Memory Database for Web Application Caches
This paper presents the architecture and characteristics of a memory database intended to be used as a cache engine for web applications. Primary goals of this database are speed a...
Ivan Voras, Danko Basch, Mario Zagar
BMCBI
2010
149views more  BMCBI 2010»
13 years 7 months ago
KID - an algorithm for fast and efficient text mining used to automatically generate a database containing kinetic information o
Background: The amount of available biological information is rapidly increasing and the focus of biological research has moved from single components to networks and even larger ...
Stephanie Heinen, Bernhard Thielen, Dietmar Schomb...