Sciweavers

93 search results - page 16 / 19
» Making k-means Even Faster
Sort
View
CIC
2004
118views Communications» more  CIC 2004»
13 years 11 months ago
An Efficient Delay Sensitive Multicast Routing Algorithm
As a key issue in multicast routing with quality of service (QoS) support, constrained minimum Steiner tree (CMST) problem has been a research focus for more than a decade, and ten...
Gang Feng
CGF
2008
156views more  CGF 2008»
13 years 9 months ago
Render2MPEG: A Perception-based Framework Towards Integrating Rendering and Video Compression
Currently 3D animation rendering and video compression are completely independent processes even if rendered frames are streamed on-the-fly within a client-server platform. In suc...
Robert Herzog, Shin-ichi Kinuwaki, Karol Myszkowsk...
HPCA
2008
IEEE
14 years 10 months ago
Performance and power optimization through data compression in Network-on-Chip architectures
The trend towards integrating multiple cores on the same die has accentuated the need for larger on-chip caches. Such large caches are constructed as a multitude of smaller cache ...
Reetuparna Das, Asit K. Mishra, Chrysostomos Nicop...
HPCA
2005
IEEE
14 years 10 months ago
Unbounded Transactional Memory
Hardware transactional memory should support unbounded transactions: transactions of arbitrary size and duration. We describe a hardware implementation of unbounded transactional ...
C. Scott Ananian, Krste Asanovic, Bradley C. Kuszm...
SIGMOD
2009
ACM
235views Database» more  SIGMOD 2009»
14 years 10 months ago
Quality and efficiency in high dimensional nearest neighbor search
Nearest neighbor (NN) search in high dimensional space is an important problem in many applications. Ideally, a practical solution (i) should be implementable in a relational data...
Yufei Tao, Ke Yi, Cheng Sheng, Panos Kalnis