Sciweavers

874 search results - page 84 / 175
» Faster Algorithms for Semi-Matching Problems
Sort
View
COMCOM
2010
276views more  COMCOM 2010»
14 years 10 months ago
Adjustable convergecast tree protocol for wireless sensor networks
For data-collection applications in sensor networks, it is important to ensure base station receives a complete picture about the monitored area. Convergecast is an important commu...
Tzung-Shi Chen, Hua-Wen Tsai, Chih-Ping Chu
KDD
2009
ACM
204views Data Mining» more  KDD 2009»
15 years 10 months ago
DOULION: counting triangles in massive graphs with a coin
Counting the number of triangles in a graph is a beautiful algorithmic problem which has gained importance over the last years due to its significant role in complex network analy...
Charalampos E. Tsourakakis, U. Kang, Gary L. Mille...
ISNN
2005
Springer
15 years 3 months ago
A Block-Adaptive Subspace Method Using Oblique Projections for Blind Separation of Convolutive Mixtures
This paper presents a block-adaptive subspace algorithm via oblique projection for blind source separation (BSS) problem of convolutive mixtures. In the proposed algorithm, the pro...
Chunyi Peng, Xianda Zhang, Qutang Cai
ECCV
2010
Springer
15 years 3 months ago
Fast Multi-Aspect 2D Human Detection
Abstract. We address the problem of detecting human figures in images, taking into account that the image of the human figure may be taken from a range of viewpoints. We capture ...
ICML
2007
IEEE
15 years 10 months ago
Scalable training of L1-regularized log-linear models
The l-bfgs limited-memory quasi-Newton method is the algorithm of choice for optimizing the parameters of large-scale log-linear models with L2 regularization, but it cannot be us...
Galen Andrew, Jianfeng Gao