Sciweavers

1871 search results - page 21 / 375
» The Ephemeral Pairing Problem
Sort
View
VL
2006
IEEE
104views Visual Languages» more  VL 2006»
14 years 2 months ago
Pair Collaboration in End-User Debugging
The problem of dependability in end-user programming is an emerging area of interest. Pair collaboration in end-user software development may offer a way for end users to debug th...
Thippaya Chintakovid, Susan Wiedenbeck, Margaret M...
IJCNLP
2004
Springer
14 years 1 months ago
Causal Relation Extraction Using Cue Phrase and Lexical Pair Probabilities
This work aims to extract causal relations that exist between two events expressed by noun phrases or sentences. The previous works for the causality made use of causal patterns su...
Du-Seong Chang, Key-Sun Choi
CSEE
2007
Springer
14 years 2 months ago
Increased Retention of Early Computer Science and Software Engineering Students Using Pair Programming
An important problem faced by many Computer Science and Software Engineering programs is declining enrollment. In an effort to reverse that trend at Mississippi State University, ...
Jeffrey C. Carver, Lisa Henderson, Lulu He, Julia ...
FSTTCS
2006
Springer
14 years 5 days ago
Context-Sensitive Dependency Pairs
Termination is one of the most interesting problems when dealing with context-sensitive rewrite systems. Although there is a good number of techniques for proving termination of co...
Beatriz Alarcón, Raúl Gutiérr...
COMBINATORICS
2006
133views more  COMBINATORICS 2006»
13 years 8 months ago
Completion of the Wilf-Classification of 3-5 Pairs Using Generating Trees
A permutation is said to avoid the permutation if no subsequence in has the same order relations as . Two sets of permutations 1 and 2 are Wilfequivalent if, for all n, the numb...
Mark Lipson