214 search results - page 37 / 43 » A linear time algorithm for L(2,1)-labeling of trees |
89
Voted
ICCAD
2005
IEEE
15 years 9 months ago
2005
IEEE
— In this paper, an efficient linear time algorithm TACO is proposed for the first time to minimize the worst case clock skew in the presence of on-chip thermal variation. TACO...
123
click to vote
VMV
2001
15 years 1 months ago
2001
Efficient isosurface extraction from large volume data sets requires special algorithms and data structures. Such algorithms typically either use a hierarchical spatial subdivisio...
121
Voted
SPAA
2004
ACM
15 years 5 months ago
2004
ACM
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
131
click to vote
MOBIHOC
2002
ACM
16 years 2 days ago
2002
ACM
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...
106
click to vote
FC
2009
Springer
15 years 7 months ago
2009
Springer
We present a cryptographic protocol for conducting efficient, provably correct and secrecy-preserving combinatorial clock-proxy auctions. The “clock phase” functions as a trust...