Sciweavers

2496 search results - page 21 / 500
» On covering by translates of a set
Sort
View
KDD
2009
ACM
168views Data Mining» more  KDD 2009»
14 years 2 months ago
Cartesian contour: a concise representation for a collection of frequent sets
In this paper, we consider a novel scheme referred to as Cartesian contour to concisely represent the collection of frequent itemsets. Different from the existing works, this sche...
Ruoming Jin, Yang Xiang, Lin Liu
AAAI
2007
13 years 10 months ago
Computational Aspects of Covering in Dominance Graphs
Various problems in AI and multiagent systems can be tackled by finding the “most desirable” elements of a set given some binary relation. Examples can be found in areas as d...
Felix Brandt, Felix A. Fischer
CICLING
2008
Springer
13 years 9 months ago
Dynamic Translation Memory: Using Statistical Machine Translation to Improve Translation Memory Fuzzy Matches
Abstract. Professional translators of technical documents often use Translation Memory (TM) systems in order to capitalize on the repetitions frequently observed in these documents...
Ergun Biçici, Marc Dymetman
COLING
2010
13 years 2 months ago
PanLex and LEXTRACT: Translating all Words of all Languages of the World
PanLex is a lemmatic translation resource which combines a large number of translation dictionaries and other translingual lexical resources. It currently covers 1353 language var...
Timothy Baldwin, Jonathan Pool, Susan M. Colowick
CCCG
2008
13 years 9 months ago
On a Cone Covering Problem
Given a set of polyhedral cones C1,
Khaled M. Elbassioni, Hans Raj Tiwary