11051 search results - page 391 / 2211 » An Investigation of Generalized Cases |
191
Voted
ACL
2011
14 years 11 months ago
2011
We investigate full-scale shortest-derivation parsing (SDP), wherein the parser selects an analysis built from the fewest number of training fragments. Shortest derivation parsing...
239
Voted
SIGSOFT
2010
ACM
15 years 5 months ago
2010
ACM
Test suite augmentation techniques are used in regression testing to identify code elements affected by changes and to generate test cases to cover those elements. Our preliminary...
213
Voted
WEA
2007
Springer
16 years 1 months ago
2007
Springer
Given a bipartite graph G = (L0, L1, E) and a fixed ordering of the nodes in L0, the problem of finding an ordering of the nodes in L1 that minimizes the number of crossings has ...
200
Voted
DIS
2005
Springer
16 years 1 months ago
2005
Springer
In the 1980s, Don Swanson proposed the concept of “undiscovered public knowledge,” and published several examples in which two disparate literatures (i.e., sets of articles hav...
200
Voted
NIPS
2007
15 years 9 months ago
2007
The notion of algorithmic stability has been used effectively in the past to derive tight generalization bounds. A key advantage of these bounds is that they are designed for spec...