1871 search results - page 309 / 375 » The Ephemeral Pairing Problem |
182
click to vote
DIALM
2003
ACM
15 years 11 months ago
2003
ACM
This paper addresses the problem of scatternet formation for singlehop Bluetooth based ad hoc networks, with minimal communication overhead. We adopt the well-known structure de B...
306
click to vote
PODS
2009
ACM
16 years 7 months ago
2009
ACM
Relational schema mappings have been extensively studied in connection with data integration and exchange problems, but mappings between XML schemas have not received the same amo...
179
click to vote
CIKM
2009
Springer
16 years 1 months ago
2009
Springer
This paper presents a study of a novel summarization problem called contrastive opinion summarization (COS). Given two sets of positively and negatively opinionated sentences whic...
185
click to vote
FSTTCS
2009
Springer
16 years 29 days ago
2009
Springer
A tournament T = (V, A) is a directed graph in which there is exactly one arc between every pair of distinct vertices. Given a digraph on n vertices and an integer parameter k, th...
176
click to vote
COMPGEOM
2009
ACM
16 years 28 days ago
2009
ACM
Following recent work of Clarkson, we translate the coreset framework to the problems of finding the point closest to the origin inside a polytope, finding the shortest distance...