Sciweavers

146 search results - page 16 / 30
» The Social Dynamics of Pair Programming
Sort
View
ICSE
2010
IEEE-ACM
13 years 10 months ago
DETERMIN: inferring likely deterministic specifications of multithreaded programs
The trend towards multicore processors and graphic processing units is increasing the need for software that can take advantage of parallelism. Writing correct parallel programs u...
Jacob Burnim, Koushik Sen
CPM
2007
Springer
99views Combinatorics» more  CPM 2007»
14 years 2 months ago
Speeding Up HMM Decoding and Training by Exploiting Sequence Repetitions
We present a method to speed up the dynamic program algorithms used for solving the HMM decoding and training problems for discrete time-independent HMMs. We discuss the applicatio...
Shay Mozes, Oren Weimann, Michal Ziv-Ukelson
ICDE
2012
IEEE
205views Database» more  ICDE 2012»
11 years 11 months ago
Optimizing Statistical Information Extraction Programs over Evolving Text
—Statistical information extraction (IE) programs are increasingly used to build real-world IE systems such as Alibaba, CiteSeer, Kylin, and YAGO. Current statistical IE approach...
Fei Chen, Xixuan Feng, Christopher Re, Min Wang
NLE
2007
180views more  NLE 2007»
13 years 8 months ago
Segmentation and alignment of parallel text for statistical machine translation
We address the problem of extracting bilingual chunk pairs from parallel text to create training sets for statistical machine translation. We formulate the problem in terms of a s...
Yonggang Deng, Shankar Kumar, William Byrne
TCS
2008
13 years 8 months ago
Algorithms for subsequence combinatorics
A subsequence is obtained from a string by deleting any number of characters; thus in contrast to a substring, a subsequence is not necessarily a contiguous part of the string. Co...
Cees H. Elzinga, Sven Rahmann, Hui Wang