Sciweavers

4757 search results - page 88 / 952
» A Unique
Sort
View
ITA
2007
118views Communications» more  ITA 2007»
15 years 3 months ago
Uniformly bounded duplication codes
Duplication is the replacement of a factor w within a word by ww. This operation can be used iteratively to generate languages starting from words or sets of words. By undoing dupl...
Peter Leupold, Victor Mitrana
JASIS
2007
83views more  JASIS 2007»
15 years 3 months ago
Dynamic h-index: The Hirsch index in function of time
When we have a group of papers and when we fix the present time we can determine the unique number h being the number of papers that received h or more citations while the other p...
Leo Egghe
JMLR
2007
58views more  JMLR 2007»
15 years 3 months ago
Distances between Data Sets Based on Summary Statistics
The concepts of similarity and distance are crucial in data mining. We consider the problem of defining the distance between two data sets by comparing summary statistics compute...
Nikolaj Tatti
AICOM
2004
92views more  AICOM 2004»
15 years 3 months ago
An efficient consistency algorithm for the Temporal Constraint Satisfaction Problem
Abstract. Dechter et al. [5] proposed solving the Temporal Constraint Satisfaction Problem (TCSP) by modeling it as a metaCSP, which is a finite CSP with a unique global constraint...
Berthe Y. Choueiry, Lin Xu
AIR
2004
143views more  AIR 2004»
15 years 3 months ago
Hebrew Computational Linguistics: Past and Future
This paper reviews the current state of the art in Natural Language Processing for Hebrew, both theoretical and practical. The Hebrew language, like other Semitic languages, poses...
Shuly Wintner