Sciweavers

1629 search results - page 246 / 326
» Hardness Results and Efficient Algorithms for Graph Powers
Sort
View
ICDE
2006
IEEE
163views Database» more  ICDE 2006»
15 years 11 months ago
A Sampling-Based Approach to Optimizing Top-k Queries in Sensor Networks
Wireless sensor networks generate a vast amount of data. This data, however, must be sparingly extracted to conserve energy, usually the most precious resource in battery-powered ...
Adam Silberstein, Carla Schlatter Ellis, Jun Yang ...
KDD
2008
ACM
181views Data Mining» more  KDD 2008»
15 years 10 months ago
Learning subspace kernels for classification
Kernel methods have been applied successfully in many data mining tasks. Subspace kernel learning was recently proposed to discover an effective low-dimensional subspace of a kern...
Jianhui Chen, Shuiwang Ji, Betul Ceran, Qi Li, Min...
IPPS
2003
IEEE
15 years 3 months ago
A P2P Approach for Global Computing
We describe a peer-to-peer self-organizing overlay network for our global computing system. The preliminary simulation results show that the network has some smallworld characteri...
Wen Dou, Yan Jia, Huaimin Wang, Wen Qiang Song, Pe...
LCN
2002
IEEE
15 years 2 months ago
Multicast Performance Analysis for High-Speed Torus Networks
Overall efficiency of high-performance computing clusters not only relies on the computing power of the individual nodes, but also on the performance that the underlying network c...
Sarp Oral, Alan D. George
ICIP
2010
IEEE
14 years 7 months ago
Fast object detection using boosted co-occurrence histograms of oriented gradients
Co-occurrence histograms of oriented gradients (CoHOG) are powerful descriptors in object detection. In this paper, we propose to utilize a very large pool of CoHOG features with ...
Haoyu Ren, Cher-Keng Heng, Wei Zheng, Luhong Liang...