Sciweavers

974 search results - page 95 / 195
» pairing 2010
Sort
View
PODC
2010
ACM
13 years 8 months ago
Brief announcement: distributed contention resolution in wireless networks
We present and analyze simple distributed contention resolution protocols for wireless networks. In our setting, one is given n pairs of senders and receivers located in a metric ...
Thomas Kesselheim, Berthold Vöcking
SMC
2010
IEEE
158views Control Systems» more  SMC 2010»
13 years 8 months ago
A study of genetic algorithms for approximating the longest path in generic graphs
Abstract--Finding the longest simple path in a generic undirected graph is a challenging issue that belongs to the NPComplete class of problems. Four approaches based on genetic al...
David Portugal, Carlos Henggeler Antunes, Rui Roch...
WEBI
2010
Springer
13 years 8 months ago
Relations Expansion: Extracting Relationship Instances from the Web
In this paper, we propose a Relation Expansion framework, which uses a few seed sentences marked up with two entities to expand a set of sentences containing target relations. Duri...
Haibo Li, Yutaka Matsuo, Mitsuru Ishizuka
ACL
2010
13 years 7 months ago
Learning Lexicalized Reordering Models from Reordering Graphs
Lexicalized reordering models play a crucial role in phrase-based translation systems. They are usually learned from the word-aligned bilingual corpus by examining the reordering ...
Jinsong Su, Yang Liu, Yajuan Lü, Haitao Mi, Q...
CONEXT
2010
ACM
13 years 7 months ago
Simple yet efficient, transparent airtime allocation for TCP in wireless mesh networks
In this paper, we explore a simple yet effective technique for explicitly allocating airtime to each active pair of communicating neighbors in a wireless neighborhood so that TCP ...
Ki-Young Jang, Konstantinos Psounis, Ramesh Govind...