Sciweavers

759 search results - page 118 / 152
» Odometers on Regular Languages
Sort
View
CPAIOR
2008
Springer
13 years 9 months ago
Counting Solutions of Knapsack Constraints
Abstract. This paper furthers the recent investigation of search heuristics based on solution counting information, by proposing and evaluating algorithms to compute solution densi...
Gilles Pesant, Claude-Guy Quimper
LREC
2008
121views Education» more  LREC 2008»
13 years 8 months ago
Evaluating a German Sketch Grammar: A Case Study on Noun Phrase Case
Word sketches are part of the Sketch Engine corpus query system. They represent automatic, corpus-derived summaries of the words' grammatical and collocational behaviour. Bes...
Kremena Ivanova, Ulrich Heid, Sabine Schulte im Wa...
NAACL
2004
13 years 8 months ago
Detecting Structural Metadata with Decision Trees and Transformation-Based Learning
The regular occurrence of disfluencies is a distinguishing characteristic of spontaneous speech. Detecting and removing such disfluencies can substantially improve the usefulness ...
Joungbum Kim, Sarah E. Schwarm, Mari Ostendorf
NIPS
2001
13 years 8 months ago
Hyperbolic Self-Organizing Maps for Semantic Navigation
We introduce a new type of Self-Organizing Map (SOM) to navigate in the Semantic Space of large text collections. We propose a "hyperbolic SOM" (HSOM) based on a regular...
Jörg Ontrup, Helge Ritter
DM
2010
88views more  DM 2010»
13 years 7 months ago
Multidimensional generalized automatic sequences and shape-symmetric morphic words
An infinite word is S-automatic if, for all n 0, its (n+1)st letter is the output of a deterministic automaton fed with the representation of n in the numeration system S. In this...
Emilie Charlier, Tomi Kärki, Michel Rigo