Sciweavers

254 search results - page 18 / 51
» Binary amiable Words
Sort
View
AE
2009
Springer
15 years 2 days ago
Memetic Algorithms for Constructing Binary Covering Arrays of Strength Three
Abstract. This paper presents a new Memetic Algorithm (MA) designed to compute near-optimal solutions for the covering array construction problem. It incorporates several distingui...
Eduardo Rodriguez-Tello, Jose Torres-Jimenez
CPM
2010
Springer
180views Combinatorics» more  CPM 2010»
15 years 3 months ago
Algorithms for Three Versions of the Shortest Common Superstring Problem
Abstract. The input to the Shortest Common Superstring (SCS) problem is a set S of k words of total length n. In the classical version the output is an explicit word SCS(S) in whic...
Maxime Crochemore, Marek Cygan, Costas S. Iliopoul...
NAACL
2003
15 years 9 days ago
Target Word Detection and Semantic Role Chunking using Support Vector Machines
In this paper, the automatic labeling of semantic roles in a sentence is considered as a chunking task. We define a semantic chunk as the sequence of words that fills a semantic...
Kadri Hacioglu, Wayne Ward
AAAI
2007
15 years 1 months ago
A Robot That Uses Existing Vocabulary to Infer Non-Visual Word Meanings from Observation
The authors present TWIG, a visually grounded wordlearning system that uses its existing knowledge of vocabulary, grammar, and action schemas to help it learn the meanings of new ...
Kevin Gold, Brian Scassellati
ACL
2007
15 years 12 days ago
PageRanking WordNet Synsets: An Application to Opinion Mining
This paper presents an application of PageRank, a random-walk model originally devised for ranking Web search results, to ranking WordNet synsets in terms of how strongly they pos...
Andrea Esuli, Fabrizio Sebastiani