10608 search results - page 1635 / 2122 » Complexity of O'Hara's Algorithm |
214
click to vote
TCS
2010
15 years 5 months ago
2010
: We study a variant of the path cover problem, namely, the k-fixed-endpoint path cover problem, or kPC for short. Given a graph G and a subset T of k vertices of V (G), a k-fixe...
235
click to vote
DAC
2010
ACM
15 years 5 months ago
2010
ACM
Integrating a large number of on-chip voltage regulators holds the promise of solving many power delivery challenges through strong local load regulation and facilitates systemlev...
176
Voted
ICCAD
2010
IEEE
15 years 5 months ago
2010
IEEE
Clock skew minimization has been an important design constraint. However, due to the complexity of Process, Voltage, and Temperature (PVT) variations, the minimization of clock sk...
233
click to vote
MOBIHOC
2010
ACM
15 years 5 months ago
2010
ACM
Dynamic spectrum auction is an effective solution to provide spectrum on-demand to many small wireless networks. As the number of participants grows, bidder collusion becomes a se...
208
Voted
AMW
2009
15 years 5 months ago
2009
We address schema design in uncertain databases. Since uncertain data is relational in nature, decomposition becomes a key issue in design. Decomposition relies on dependency theo...