Sciweavers

11051 search results - page 348 / 2211
» An Investigation of Generalized Cases
Sort
View
129
Voted
ANLP
1997
65views more  ANLP 1997»
15 years 8 months ago
Semi-Automatic Acquisition of Domain-Specific Translation Lexicons
We investigate the utility of an algorithm for translation lexicon acquisition (SABLE), used previously on a very large corpus to acquire general translation lexicons, when that a...
Philip Resnik, I. Dan Melamed
IPL
2008
104views more  IPL 2008»
15 years 6 months ago
A note on harmonic subgraphs in labelled geometric graphs
Let S be a set of n points in general position in the plane, labelled bijectively with the integers {0, 1, . . ., n - 1}. Each edge (the straight segment that joins two points) is...
Gabriela Araujo, József Balogh, Ruy Fabila ...
TCS
2010
15 years 5 months ago
Maximal width learning of binary functions
This paper concerns learning binary-valued functions defined on IR, and investigates how a particular type of ‘regularity’ of hypotheses can be used to obtain better generali...
Martin Anthony, Joel Ratsaby
ISAAC
2005
Springer
93views Algorithms» more  ISAAC 2005»
16 years 11 days ago
Representation of Graphs by OBDDs
Abstract. In this paper, the space requirements for the OBDD representation of certain graph classes, specifically cographs, several types of graphs with few P4s, unit interval gr...
Robin Nunkesser, Philipp Woelfel
APPROX
2004
Springer
116views Algorithms» more  APPROX 2004»
16 years 8 days ago
Randomized Approximation Algorithms for Set Multicover Problems with Applications to Reverse Engineering of Protein and Gene Net
In this paper we investigate the computational complexity of a combinatorial problem that arises in the reverse engineering of protein and gene networks. Our contributions are as ...
Piotr Berman, Bhaskar DasGupta, Eduardo D. Sontag