974 search results - page 95 / 195 » pairing 2010 |
132
click to vote
PODC
2010
ACM
15 years 1 months ago
2010
ACM
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 ...
167
click to vote
SMC
2010
IEEE
15 years 1 months ago
2010
IEEE
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...
160
Voted
WEBI
2010
Springer
15 years 1 months ago
2010
Springer
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...
111
Voted
ACL
2010
15 years 23 days ago
2010
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 ...
130
click to vote
CONEXT
2010
ACM
15 years 21 days ago
2010
ACM
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 ...