Sciweavers

1211 search results - page 52 / 243
» Computing Manipulations of Ranking Systems
Sort
View
COLING
2010
13 years 2 months ago
Integrating N-best SMT Outputs into a TM System
In this paper, we propose a novel framework to enrich Translation Memory (TM) systems with Statistical Machine Translation (SMT) outputs using ranking. In order to offer the human...
Yifan He, Yanjun Ma, Andy Way, Josef van Genabith
JSC
2007
79views more  JSC 2007»
13 years 7 months ago
Computation of bases of free modules over the Weyl algebras
A well-known result due to J. T. Stafford asserts that a stably free left module M over the Weyl algebras D = An(k) or Bn(k) − where k is a field of characteristic 0 − with ...
Alban Quadrat, Daniel Robertz
IPPS
2008
IEEE
14 years 2 months ago
Model-based fault localization in large-scale computing systems
We propose a new fault localization technique for software bugs in large-scale computing systems. Our technique always collects per-process function call traces of a target system...
Naoya Maruyama, Satoshi Matsuoka
MIDDLEWARE
2007
Springer
14 years 1 months ago
Flexible matching and ranking of web service advertisements
With the growing number of service advertisements in service marketplaces, there is a need for matchmakers which select and rank functionally similar services based on nonfunction...
Navid Ahmadi, Walter Binder
WSDM
2009
ACM
104views Data Mining» more  WSDM 2009»
14 years 2 months ago
Top-k aggregation using intersections of ranked inputs
There has been considerable past work on efficiently computing top k objects by aggregating information from multiple ranked lists of these objects. An important instance of this...
Ravi Kumar, Kunal Punera, Torsten Suel, Sergei Vas...