Sciweavers

2200 search results - page 24 / 440
» Programming norm change
Sort
View
MSR
2006
ACM
15 years 3 months ago
Are refactorings less error-prone than other changes?
Refactorings are program transformations which should preserve the program behavior. Consequently, we expect that during phases when there are mostly refactorings in the change hi...
Peter Weißgerber, Stephan Diehl
74
Voted
ICASSP
2008
IEEE
15 years 4 months ago
Robust adaptive beamforming using sequential quadratic programming
In this paper, a new algorithm for robust adaptive beamforming is developed. The basic idea of the proposed algorithm is to estimate the difference between the actual and presumed...
Aboulnasr Hassanien, Sergiy A. Vorobyov, Kon Max W...
ECML
2006
Springer
14 years 11 months ago
Efficient Large Scale Linear Programming Support Vector Machines
This paper presents a decomposition method for efficiently constructing 1-norm Support Vector Machines (SVMs). The decomposition algorithm introduced in this paper possesses many d...
Suvrit Sra
PPDP
2001
Springer
15 years 2 months ago
Granularity of Constraint-Based Analysis for Java
Ì × Ô Ô ÖÔÖÓÔÓ× × ØÖ Ò× ÓÖÑ Ø ÓÒ¹ × ÔÔÖÓ ØÓ ¹ × Ò ÓÒ×ØÖ ÒØ¹ × Ò ÐÝ× × ÓÖ Â Ú Ø Ó Ö× Ö Ö ÒÙ¹ Ð Ö ØÝº ÁÒ Ø × Ô...
Byeong-Mo Chang, Jang-Wu Jo
POPL
2011
ACM
14 years 16 days ago
Calling context abstraction with shapes
Xavier Rival, Bor-Yuh Evan Chang