Sciweavers

2745 search results - page 273 / 549
» A fast algorithm for computing large Fibonacci numbers
Sort
View
GD
2004
Springer
15 years 10 months ago
A Note on the Self-similarity of Some Orthogonal Drawings
Large graphs are difficult to browse and to visually explore. This note adds up evidence that some graph drawing techniques, which produce readable layouts when applied to medium-s...
Maurizio Patrignani
INFOCOM
2012
IEEE
13 years 7 months ago
Fair background data transfers of minimal delay impact
—In this paper we present a methodology for the design of congestion control protocols for background data transfers that have a minimal delay impact on short TCP transfers and c...
Costas Courcoubetis, Antonis Dimakis
ICC
2007
IEEE
340views Communications» more  ICC 2007»
15 years 11 months ago
A Decentralized Positioning Method for Wireless Sensor Networks Based on Weighted Interpolation
— A decentralized sensor positioning algorithm is proposed using an adaptive weighted-interpolation method. The proposed method utilizes in-network processing among sensors to co...
Chin-Liang Wang, Yao-Win Hong, Yu-Sheng Dai
129
Voted
CG
2008
Springer
15 years 5 months ago
Tight and efficient surface bounds in meshless animation
This paper presents a fast approach for computing tight surface bounds in meshless animation, and its application to collision detection. Given a high-resolution surface animated ...
Denis Steinemann, Miguel A. Otaduy, Markus H. Gros...
152
Voted
PRL
2006
180views more  PRL 2006»
15 years 4 months ago
MutualBoost learning for selecting Gabor features for face recognition
This paper describes an improved boosting algorithm, the MutualBoost algorithm, and its application in developing a fast and robust Gabor feature based face recognition system. Th...
LinLin Shen, Li Bai