945 search results - page 40 / 189 » On the robustness of primitive words |
172
click to vote
FSE
2005
Springer
15 years 11 months ago
2005
Springer
A T-function is a mapping from n-bit words to n-bit words in which for each 0 ≤ i < n, bit i of any output word can depend only on bits 0, 1, . . . , i of any input word. All ...
182
click to vote
CICLING
2008
Springer
15 years 8 months ago
2008
Springer
In the project we describe, we have taken a basic core of about 5000 synsets in WordNet that are the most frequently used, and we have categorized these into sixteen broad categori...
157
click to vote
ICIP
2006
IEEE
16 years 7 months ago
2006
IEEE
A novel statistical approch for detection and tracking of objects is presented here, which uses both edge and color information in a particle filter. The approach does not need an...
166
click to vote
ICASSP
2011
IEEE
14 years 9 months ago
2011
IEEE
This paper describes a text normalization system for deletion-based abbreviations in informal text. We propose using statistical classifiers to learn the probability of deleting ...
258
click to vote
ICALP
2011
Springer
14 years 9 months ago
2011
Springer
Given an unlabeled, unweighted, and undirected graph with n vertices and small (but not necessarily constant) treewidth k, we consider the problem of preprocessing the graph to bui...