Sciweavers

2181 search results - page 115 / 437
» The restriction scaffold problem
Sort
View
76
Voted
EMNLP
2010
14 years 10 months ago
Generating Confusion Sets for Context-Sensitive Error Correction
In this paper, we consider the problem of generating candidate corrections for the task of correcting errors in text. We focus on the task of correcting errors in preposition usag...
Alla Rozovskaya, Dan Roth
96
Voted
TOPLAS
2008
81views more  TOPLAS 2008»
15 years 18 days ago
Size-change termination with difference constraints
lem of inferring termination from such abstract information is not the halting problem for programs and may well be decidable. If this is the case, the decision algorithm forms a &...
Amir M. Ben-Amram
95
Voted
SIAMJO
2010
100views more  SIAMJO 2010»
14 years 7 months ago
Explicit Sensor Network Localization using Semidefinite Representations and Facial Reductions
The sensor network localization, SNL , problem in embedding dimension r, consists of locating the positions of wireless sensors, given only the distances between sensors that are ...
Nathan Krislock, Henry Wolkowicz
113
Voted
CIAC
2010
Springer
251views Algorithms» more  CIAC 2010»
15 years 10 months ago
A parameterized algorithm for Chordal Sandwich
Given an arbitrary graph G = (V, E) and an additional set of admissible edges F, the Chordal Sandwich problem asks whether there exists a chordal graph (V, E F ) such that F F. ...
Pinar Heggernes, Federico Mancini, Jesper Nederlof...
111
Voted
CSR
2009
Springer
15 years 7 months ago
Partitioning Graphs into Connected Parts
The 2-Disjoint Connected Subgraphs problem asks if a given graph has two vertex-disjoint connected subgraphs containing prespecified sets of vertices. We show that this problem is...
Pim van 't Hof, Daniël Paulusma, Gerhard J. W...