Sciweavers

4103 search results - page 485 / 821
» Some results on the Collatz problem
Sort
View
CORR
2011
Springer
192views Education» more  CORR 2011»
15 years 1 months ago
Improved Approximation Guarantees for Lower-Bounded Facility Location
d Abstract) Sara Ahmadian∗ Chaitanya Swamy∗ We consider the lower-bounded facility location (LBFL) problem (also sometimes called load-balanced facility location), which is a ...
Sara Ahmadian, Chaitanya Swamy
PRL
2010
188views more  PRL 2010»
15 years 1 months ago
A fast divisive clustering algorithm using an improved discrete particle swarm optimizer
As an important technique for data analysis, clustering has been employed in many applications such as image segmentation, document clustering and vector quantization. Divisive cl...
Liang Feng, Ming-Hui Qiu, Yu-Xuan Wang, Qiao-Liang...
TCAD
2010
194views more  TCAD 2010»
15 years 1 months ago
Layout Decomposition Approaches for Double Patterning Lithography
Abstract--In double patterning lithography (DPL) layout decomposition for 45nm and below process nodes, two features must be assigned opposite colors (corresponding to different ex...
Andrew B. Kahng, Chul-Hong Park, Xu Xu, Hailong Ya...
TOG
2010
117views more  TOG 2010»
15 years 1 months ago
Multi-feature matching of fresco fragments
We present a multiple-feature approach for determining matches between small fragments of archaeological artifacts such as Bronze-Age and Roman frescoes. In contrast with traditio...
Corey Toler-Franklin, Benedict J. Brown, Tim Weyri...
CORR
2011
Springer
169views Education» more  CORR 2011»
14 years 10 months ago
Pseudo-random graphs and bit probe schemes with one-sided error
We study probabilistic bit-probe schemes for the membership problem. Given a set A of at most n elements from the universe of size m we organize such a structure that queries of t...
Andrei E. Romashchenko