Sciweavers

2745 search results - page 387 / 549
» A fast algorithm for computing large Fibonacci numbers
Sort
View
141
Voted
CORR
2010
Springer
173views Education» more  CORR 2010»
15 years 5 months ago
CONCISE: Compressed 'n' Composable Integer Set
Bit arrays, or bitmaps, are used to significantly speed up set operations in several areas, such as data warehousing, information retrieval, and data mining, to cite a few. Howeve...
Alessandro Colantonio, Roberto Di Pietro
AFRIGRAPH
2009
ACM
15 years 8 months ago
Using an implicit min/max KD-tree for doing efficient terrain line of sight calculations
The generation of accurate Line of Sight (LOS) visibility information consumes significant resources in large scale synthetic environments such as many-on-many serious games and b...
Bernardt Duvenhage
KDD
2005
ACM
178views Data Mining» more  KDD 2005»
15 years 10 months ago
Failure detection and localization in component based systems by online tracking
The increasing complexity of today’s systems makes fast and accurate failure detection essential for their use in mission-critical applications. Various monitoring methods provi...
Haifeng Chen, Guofei Jiang, Cristian Ungureanu, Ke...
SIGECOM
2006
ACM
119views ECommerce» more  SIGECOM 2006»
15 years 10 months ago
Nash equilibria in graphical games on trees revisited
Graphical games have been proposed as a game-theoretic model of large-scale distributed networks of non-cooperative agents. When the number of players is large, and the underlying...
Edith Elkind, Leslie Ann Goldberg, Paul W. Goldber...
JRTIP
2008
118views more  JRTIP 2008»
15 years 4 months ago
Custom parallel caching schemes for hardware-accelerated image compression
Abstract In an effort to achieve lower bandwidth requirements, video compression algorithms have become increasingly complex. Consequently, the deployment of these algorithms on Fi...
Su-Shin Ang, George A. Constantinides, Wayne Luk, ...