Sciweavers

4315 search results - page 773 / 863
» Sorting in linear time
Sort
View
TSP
2008
154views more  TSP 2008»
13 years 8 months ago
Algebraic Signal Processing Theory: 1-D Space
In our paper titled "Algebraic Signal Processing Theory: Foundation and 1-D Time" appearing in this issue of the IEEE TRANSACTIONS ON SIGNAL PROCESSING, we presented the ...
Markus Püschel, José M. F. Moura
JMLR
2010
157views more  JMLR 2010»
13 years 7 months ago
Kronecker Graphs: An Approach to Modeling Networks
How can we generate realistic networks? In addition, how can we do so with a mathematically tractable model that allows for rigorous analysis of network properties? Real networks ...
Jure Leskovec, Deepayan Chakrabarti, Jon M. Kleinb...
ASPDAC
2010
ACM
637views Hardware» more  ASPDAC 2010»
13 years 7 months ago
A new graph-theoretic, multi-objective layout decomposition framework for double patterning lithography
As Double Patterning Lithography(DPL) becomes the leading candidate for sub-30nm lithography process, we need a fast and lithography friendly decomposition framework. In this pape...
Jae-Seok Yang, Katrina Lu, Minsik Cho, Kun Yuan, D...
ECCC
2011
223views ECommerce» more  ECCC 2011»
13 years 3 months ago
A Case of Depth-3 Identity Testing, Sparse Factorization and Duality
Polynomial identity testing (PIT) problem is known to be challenging even for constant depth arithmetic circuits. In this work, we study the complexity of two special but natural ...
Chandan Saha, Ramprasad Saptharishi, Nitin Saxena
MST
2010
187views more  MST 2010»
13 years 3 months ago
Distributed Approximation of Capacitated Dominating Sets
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...
Fabian Kuhn, Thomas Moscibroda