Sciweavers

935 search results - page 101 / 187
» A New Statistical Optimization Algorithm for Gate Sizing
Sort
View
FOCS
1999
IEEE
15 years 7 months ago
Near-Optimal Conversion of Hardness into Pseudo-Randomness
Various efforts ([?, ?, ?]) have been made in recent years to derandomize probabilistic algorithms using the complexity theoretic assumption that there exists a problem in E = dti...
Russell Impagliazzo, Ronen Shaltiel, Avi Wigderson
121
Voted
NECO
2007
95views more  NECO 2007»
15 years 2 months ago
Support Vector Ordinal Regression
In this paper, we propose two new support vector approaches for ordinal regression, which optimize multiple thresholds to define parallel discriminant hyperplanes for the ordinal...
Wei Chu, S. Sathiya Keerthi
IPPS
2009
IEEE
15 years 10 months ago
Implementing and evaluating multithreaded triad census algorithms on the Cray XMT
Commonly represented as directed graphs, social networks depict relationships and behaviors among social entities such as people, groups, and organizations. Social network analysi...
George Chin Jr., Andrès Márquez, Sut...
ISPD
1998
ACM
89views Hardware» more  ISPD 1998»
15 years 7 months ago
Filling and slotting: analysis and algorithms
In very deep-submicron VLSI, certain manufacturing steps – notably optical exposure, resist development and etch, chemical vapor deposition and chemical-mechanical polishing (CM...
Andrew B. Kahng, Gabriel Robins, Anish Singh, Huij...
TCS
2010
15 years 1 months ago
Tight results for Next Fit and Worst Fit with resource augmentation
It is well known that the two simple algorithms for the classic bin packing problem, NF and WF both have an approximation ratio of 2. However, WF seems to be a more reasonable alg...
Joan Boyar, Leah Epstein, Asaf Levin