2124 search results - page 156 / 425 » Aggregating time partitions |
142
click to vote
SRDS
1999
IEEE
15 years 8 months ago
1999
IEEE
Ad-hoc wireless networks have no wired component, and may have unpredictable mobility pattern. Such networks can get partitioned and reconnected several times. One possible approa...
120
click to vote
JGAA
2008
15 years 4 months ago
2008
Let G be a bipartite graph, and let e, i be two parallel convex curves; we study the question about whether G admits a planar straight-line drawing such that the vertices of one p...
150
click to vote
SIAMCOMP
1998
15 years 3 months ago
1998
We describe a new randomized data structure, the sparse partition, for solving the dynamic closest-pair problem. Using this data structure the closest pair of a set of n points in ...
151
click to vote
STOC
2007
ACM
16 years 4 months ago
2007
ACM
We present a polynomial time approximation scheme (PTAS) for the minimum feedback arc set problem on tournaments. A simple weighted generalization gives a PTAS for KemenyYoung ran...
155
click to vote
GRID
2007
Springer
15 years 10 months ago
2007
Springer
— We describe an information service that aggregates metadata available in hundreds of information sources of the EGEE Grid infrastructure. It uses an ontology-based information ...