Sciweavers

1872 search results - page 71 / 375
» The Art of Granular Computing
Sort
View
ICMCS
2005
IEEE
97views Multimedia» more  ICMCS 2005»
14 years 4 months ago
A computationally efficient 3D shape rejection algorithm
In this paper, we present an efficient 3D shape rejection algorithm for unlabeled 3D markers. The problem is important in domains such as rehabilitation and the performing arts. T...
Yinpeng Chen, Hari Sundaram
FPL
2009
Springer
115views Hardware» more  FPL 2009»
14 years 3 months ago
Recursion in reconfigurable computing: A survey of implementation approaches
Reconfigurable systems are widely used nowadays to increase performance of computationally intensive applications. There exist a lot of synthesis tools that automatically generate...
Iouliia Skliarova, Valery Sklyarov
IJCAI
2007
14 years 18 days ago
Computing Semantic Relatedness Using Wikipedia-based Explicit Semantic Analysis
Computing semantic relatedness of natural language texts requires access to vast amounts of common-sense and domain-specific world knowledge. We propose Explicit Semantic Analysi...
Evgeniy Gabrilovich, Shaul Markovitch
NA
2006
84views more  NA 2006»
13 years 11 months ago
Fast Moreau envelope computation I: numerical algorithms
Abstract. The present article summarizes the state of the art algorithms to compute the discrete Moreau envelope, and presents a new linear-time algorithm, named NEP for NonExpansi...
Yves Lucet
AIR
2004
143views more  AIR 2004»
13 years 11 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