Sciweavers

4342 search results - page 549 / 869
» Improved Algorithms for Optimal Embeddings
Sort
View
STOC
2001
ACM
115views Algorithms» more  STOC 2001»
16 years 7 months ago
Running time and program size for self-assembled squares
Recently Rothemund and Winfree 6] have considered the program size complexity of constructing squares by selfassembly. Here, we consider the time complexity of such constructions ...
Leonard M. Adleman, Qi Cheng, Ashish Goel, Ming-De...
GECCO
2007
Springer
168views Optimization» more  GECCO 2007»
16 years 27 days ago
Genetic multi-step search in interpolation and extrapolation domain
The deterministic Multi-step Crossover Fusion (dMSXF) is an improved crossover method of MSXF which is a promising method of JSP, and it shows high availability in TSP. Both of th...
Yoshiko Hanada, Tomoyuki Hiroyasu, Mitsunori Miki
CORR
2007
Springer
111views Education» more  CORR 2007»
15 years 6 months ago
A New Perspective on Multi-user Power Control Games in Interference Channels
This paper considers the problem of how to allocate power among competing users sharing a frequency-selective interference channel. We model the interaction between these selfish ...
Yi Su, Mihaela van der Schaar
CVPR
2012
IEEE
13 years 9 months ago
Locality-constrained and spatially regularized coding for scene categorization
Improving coding and spatial pooling for bag-of-words based feature design have gained a lot of attention in recent works addressing object recognition and scene classification. ...
Aymen Shabou, Hervé Le Borgne
ACCV
2009
Springer
16 years 1 months ago
A Dynamic Programming Approach to Maximizing Tracks for Structure from Motion
We present a novel algorithm for improving the accuracy of structure from motion on video sequences. Its goal is to efficiently recover scene structure and camera pose by using dyn...
Jonathan Mooser, Suya You, Ulrich Neumann, Raphael...