Sciweavers

14518 search results - page 423 / 2904
» Two Problems for Sophistication
Sort
View
134
Voted
CCCG
2008
15 years 8 months ago
Polygons Folding to Plural Incongruent Orthogonal Boxes
We investigate the problem of finding orthogonal polygons that fold to plural incongruent orthogonal boxes. There are two known polygons that fold to produce two incongruent ortho...
Ryuhei Uehara
139
Voted
LREC
2008
74views Education» more  LREC 2008»
15 years 8 months ago
Building Bilingual Lexicons using Lexical Translation Probabilities via Pivot Languages
This paper proposes a method of increasing the size of a bilingual lexicon obtained from two other bilingual lexicons via a pivot language. When we apply this approach, there are ...
Takashi Tsunakawa, Naoaki Okazaki, Jun-ichi Tsujii
182
Voted
DLOG
2003
15 years 8 months ago
Comparing Natural Language Documents: a DL Based Approach
We propose a method to compare semantically two natural language texts. The process is realized in two steps, the first translates the texts into description logics terminologies...
Naouel Karam, Michel Schneider
KDD
2009
ACM
198views Data Mining» more  KDD 2009»
16 years 7 months ago
Pervasive parallelism in data mining: dataflow solution to co-clustering large and sparse Netflix data
All Netflix Prize algorithms proposed so far are prohibitively costly for large-scale production systems. In this paper, we describe an efficient dataflow implementation of a coll...
Srivatsava Daruru, Nena M. Marin, Matt Walker, Joy...
268
Voted
SIGMOD
2007
ACM
153views Database» more  SIGMOD 2007»
16 years 7 months ago
Scaling games to epic proportion
We introduce scalability for computer games as the next frontier for techniques from data management. A very important aspect of computer games is the artificial intelligence (AI)...
Walker M. White, Alan J. Demers, Christoph Koch, J...