Sciweavers

11213 search results - page 1814 / 2243
» Low-contention data structures
Sort
View
ICDCS
2007
IEEE
16 years 1 months ago
mTreebone: A Hybrid Tree/Mesh Overlay for Application-Layer Live Video Multicast
Application-layer overlay networks have recently emerged as a promising solution for live media multicast on the Internet. A tree is probably the most natural structure for a mult...
Feng Wang, Yongqiang Xiong, Jiangchuan Liu
IPPS
2007
IEEE
16 years 1 months ago
Load Miss Prediction - Exploiting Power Performance Trade-offs
— Modern CPUs operate at GHz frequencies, but the latencies of memory accesses are still relatively large, in the order of hundreds of cycles. Deeper cache hierarchies with large...
Konrad Malkowski, Greg M. Link, Padma Raghavan, Ma...
IROS
2007
IEEE
254views Robotics» more  IROS 2007»
16 years 1 months ago
3D datasets segmentation based on local attribute variation
— We present a Graph-based method for low-level segmentation of unfiltered 3D data. The core of this approach is based on the construction of a local neighborhood structure and ...
Carla Silva Rocha Aguiar, Sébastien Druon, ...
AUSAI
2007
Springer
16 years 1 months ago
Merging Algorithm to Reduce Dimensionality in Application to Web-Mining
Dimensional reduction may be effective in order to compress data without loss of essential information. Also, it may be useful in order to smooth data and reduce random noise. The...
Vladimir Nikulin, Geoffrey J. McLachlan
AUSDM
2007
Springer
193views Data Mining» more  AUSDM 2007»
16 years 1 months ago
Are Zero-suppressed Binary Decision Diagrams Good for Mining Frequent Patterns in High Dimensional Datasets?
Mining frequent patterns such as frequent itemsets is a core operation in many important data mining tasks, such as in association rule mining. Mining frequent itemsets in high-di...
Elsa Loekito, James Bailey
« Prev « First page 1814 / 2243 Last » Next »