Sciweavers

2200 search results - page 350 / 440
» Bloch's Constant is Computable
Sort
View
SIAMAM
2010
96views more  SIAMAM 2010»
14 years 8 months ago
Mathematical Modeling of Vascular Stents
Abstract. We present a mathematical model for a study of the mechanical properties of endovascular stents in their expanded state. The model is based on the theory of slender curve...
Josip Tambaca, M. Kosor, Suncica Canic, D. Paniagu...
SMC
2010
IEEE
198views Control Systems» more  SMC 2010»
14 years 8 months ago
Fast tracking of natural textures using fractal snakes
Abstract — The natural environments that robotic applications often encounter can present difficult problems for imagebased task execution. Prior efforts have used both grayscale...
Christopher E. Smith
SPIRE
2010
Springer
14 years 8 months ago
Why Large Closest String Instances Are Easy to Solve in Practice
We initiate the study of the smoothed complexity of the Closest String problem by proposing a semi-random model of Hamming distance. We restrict interest to the optimization versio...
Christina Boucher, Kathleen Wilkie
WDAG
2010
Springer
233views Algorithms» more  WDAG 2010»
14 years 8 months ago
Minimum Dominating Set Approximation in Graphs of Bounded Arboricity
Abstract. Since in general it is NP-hard to solve the minimum dominating set problem even approximatively, a lot of work has been dedicated to central and distributed approximation...
Christoph Lenzen, Roger Wattenhofer
FSTTCS
2010
Springer
14 years 8 months ago
Finding Independent Sets in Unions of Perfect Graphs
ABSTRACT. The maximum independent set problem (MAXIS) on general graphs is known to be NPhard to approximate within a factor of n1-, for any > 0. However, there are many "...
Venkatesan T. Chakaravarthy, Vinayaka Pandit, Samb...