2124 search results - page 279 / 425 » Aggregating time partitions |
176
click to vote
ISPD
2010
ACM
16 years 1 months ago
2010
ACM
Obstacle-avoiding rectilinear Steiner minimal tree (OARSMT) construction is becoming one of the most sought after problems in modern design flow. In this paper we present FOARS, ...
187
click to vote
QSHINE
2009
IEEE
16 years 1 months ago
2009
IEEE
Exploiting features of high density wireless sensor networks represents a challenging issue. In this work, the training of a sensor network which consists of anonymous and asynchro...
154
click to vote
COMPGEOM
2009
ACM
16 years 24 days ago
2009
ACM
We present the Iterated-Tverberg algorithm, the first deterministic algorithm for computing an approximate centerpoint of a set S ∈ Rd with running time sub-exponential in d. T...
155
click to vote
MM
2009
ACM
16 years 24 days ago
2009
ACM
Progressive mesh streaming is increasingly used in 3D networked applications, such as online games, virtual worlds, and digital museums. To scale such applications to a large numb...
138
click to vote
CDC
2008
IEEE
16 years 23 days ago
2008
IEEE
— Consider a coverage problem for a team of agents in the plane: target points appear sporadically over time in a bounded environment and must be visited by one of the agents. It...