Sciweavers

734 search results - page 21 / 147
» Narrowing the Narrowing Space
Sort
View
KCAP
2003
ACM
14 years 1 months ago
Learning programs from traces using version space algebra
While existing learning techniques can be viewed as inducing programs from examples, most research has focused on rather narrow classes of programs, e.g., decision trees or logic ...
Tessa A. Lau, Pedro Domingos, Daniel S. Weld
DAGM
2008
Springer
13 years 9 months ago
Space-Time Multi-Resolution Banded Graph-Cut for Fast Segmentation
Abstract. Applying real-time segmentation is a major issue when processing every frame of image sequences. In this paper, we propose a modification of the well known graph-cut algo...
Tobi Vaudrey, Daniel Gruber, Andreas Wedel, Jens K...
JACM
2006
112views more  JACM 2006»
13 years 7 months ago
Linear work suffix array construction
Suffix trees and suffix arrays are widely used and largely interchangeable index structures on strings and sequences. Practitioners prefer suffix arrays due to their simplicity an...
Juha Kärkkäinen, Peter Sanders, Stefan B...
ICPPW
2009
IEEE
13 years 5 months ago
Characterizing the Performance of
Using Linux for high-performance applications on the compute nodes of IBM Blue Gene/P is challenging because of TLB misses and difficulties with programming the network DMA engine...
Kazutomo Yoshii, Kamil Iskra, Harish Naik, Pete Be...
SCAM
2007
IEEE
14 years 2 months ago
Finding Inputs that Reach a Target Expression
We present an automated program analysis, called Reach, to compute program inputs that cause evaluation of explicitly-marked target expressions. Reach has a range of applications ...
Matthew Naylor, Colin Runciman