Sciweavers

514 search results - page 85 / 103
» Dependency Analysis of Ada Programs
Sort
View
COLT
2005
Springer
14 years 26 days ago
Martingale Boosting
In recent work Long and Servedio [LS05] presented a “martingale boosting” algorithm that works by constructing a branching program over weak classifiers and has a simple anal...
Philip M. Long, Rocco A. Servedio
PCI
2005
Springer
14 years 25 days ago
Tuning Blocked Array Layouts to Exploit Memory Hierarchy in SMT Architectures
Cache misses form a major bottleneck for memory-intensive applications, due to the significant latency of main memory accesses. Loop tiling, in conjunction with other program tran...
Evangelia Athanasaki, Kornilios Kourtis, Nikos Ana...
ICALP
2004
Springer
14 years 21 days ago
Sublinear-Time Approximation for Clustering Via Random Sampling
Abstract. In this paper we present a novel analysis of a random sampling approach for three clustering problems in metric spaces: k-median, min-sum kclustering, and balanced k-medi...
Artur Czumaj, Christian Sohler
CASCON
2003
120views Education» more  CASCON 2003»
13 years 8 months ago
Robust multilingual parsing using island grammars
Any attempt at automated software analysis or modification must be preceded by a comprehension step, i.e. parsing. This task, while often considered straightforward, can in fact ...
Nikita Synytskyy, James R. Cordy, Thomas R. Dean
SIGIR
2008
ACM
13 years 7 months ago
Optical character recognition errors and their effects on natural language processing
Errors are unavoidable in advanced computer vision applications such as optical character recognition, and the noise induced by these errors presents a serious challenge to downstr...
Daniel P. Lopresti