Sciweavers

2654 search results - page 390 / 531
» On Pairing Inversion Problems
Sort
View
SIAMDM
2010
128views more  SIAMDM 2010»
15 years 2 months ago
Permutation Capacities of Families of Oriented Infinite Paths
K¨orner and Malvenuto asked whether one can find n n/2 linear orderings (i.e., permutations) of the first n natural numbers such that any pair of them places two consecutive int...
Graham Brightwell, Gérard D. Cohen, Emanuel...
EMNLP
2010
15 years 2 months ago
Mining Name Translations from Entity Graph Mapping
This paper studies the problem of mining entity translation, specifically, mining English and Chinese name pairs. Existing efforts can be categorized into (a) a transliterationbas...
Gae-won You, Seung-won Hwang, Young-In Song, Long ...
ICDM
2010
IEEE
164views Data Mining» more  ICDM 2010»
15 years 2 months ago
On Finding Similar Items in a Stream of Transactions
While there has been a lot of work on finding frequent itemsets in transaction data streams, none of these solve the problem of finding similar pairs according to standard similar...
Andrea Campagna, Rasmus Pagh
PIMRC
2010
IEEE
15 years 2 months ago
Low-complexity admission control for distributed power-controlled networks with stochastic channels
This study addresses the general problem of efficient resource management in wireless networks with arbitrary timevarying topologies. Communication channels are assumed to generall...
Stepán Kucera, Bing Zhang
PKDD
2010
Springer
164views Data Mining» more  PKDD 2010»
15 years 2 months ago
Complexity Bounds for Batch Active Learning in Classification
Active learning [1] is a branch of Machine Learning in which the learning algorithm, instead of being directly provided with pairs of problem instances and their solutions (their l...
Philippe Rolet, Olivier Teytaud