Sciweavers

42230 search results - page 8166 / 8446
» Algorithms and Complexity Results for
Sort
View
DAC
2006
ACM
16 years 7 months ago
Timing-driven Steiner trees are (practically) free
Traditionally, rectilinear Steiner minimum trees (RSMT) are widely used for routing estimation in design optimizations like floorplanning and physical synthesis. Since it optimize...
Charles J. Alpert, Andrew B. Kahng, Cliff C. N. Sz...
DAC
2006
ACM
16 years 7 months ago
Standard cell characterization considering lithography induced variations
As VLSI technology scales toward 65nm and beyond, both timing and power performance of integrated circuits are increasingly affected by process variations. In practice, people oft...
Ke Cao, Sorin Dobre, Jiang Hu
DAC
2006
ACM
16 years 7 months ago
BoxRouter: a new global router based on box expansion and progressive ILP
In this paper, we propose a new global router, BoxRouter, powered by the concept of box expansion and progressive integer linear programming (ILP). BoxRouter first uses a simple P...
Minsik Cho, David Z. Pan
MICCAI
2006
Springer
16 years 7 months ago
A New CAD System for the Evaluation of Kidney Diseases Using DCE-MRI
Acute rejection is the most common reason of graft failure after kidney transplantation, and early detection is crucial to survive the transplanted kidney function. In this paper, ...
Ayman El-Baz, Rachid Fahmi, Seniha Esen Yuksel, Al...
ICML
2007
IEEE
16 years 7 months ago
Learning to rank: from pairwise approach to listwise approach
The paper is concerned with learning to rank, which is to construct a model or a function for ranking objects. Learning to rank is useful for document retrieval, collaborative fil...
Zhe Cao, Tao Qin, Tie-Yan Liu, Ming-Feng Tsai, Han...
« Prev « First page 8166 / 8446 Last » Next »