4009 search results - page 605 / 802 » Clustering on Complex Graphs |
151
click to vote
ICDAR
2003
IEEE
15 years 11 months ago
2003
IEEE
We are concerned with the extraction of tables from exchange format representations of very diverse composite documents. We put forward a flexible representation scheme for comple...
152
click to vote
IPPS
2003
IEEE
15 years 11 months ago
2003
IEEE
In this paper, we consider the problem of scheduling independent identical tasks on heterogeneous processors where communication times and processing times are different. We assum...
160
click to vote
ESA
2003
Springer
15 years 11 months ago
2003
Springer
Let G = (V, E) be an undirected graph, with three numbers d0(e) ≥ d1(e) ≥ d2(e) ≥ 0 for each edge e ∈ E. A solution is a subset U ⊆ V and di(e) represents the cost contr...
167
click to vote
PODC
2009
ACM
15 years 11 months ago
2009
ACM
We present DRR-gossip, an energy-efficient and robust aggregate computation algorithm in wireless sensor networks. We prove that the DRR-gossip algorithm requires O(n) messages a...
150
click to vote
POPL
2000
ACM
15 years 11 months ago
2000
ACM
In 1998 Asperti and Mairson proved that the cost of reducing a lambda-term using an optimal lambda-reducer (a la L´evy) cannot be bound by any elementary function in the number o...