Sciweavers

12264 search results - page 2255 / 2453
» Analysis of the rubberband algorithm
Sort
View
MST
2010
98views more  MST 2010»
15 years 2 months ago
Why Almost All k-Colorable Graphs Are Easy to Color
Coloring a k-colorable graph using k colors (k ≥ 3) is a notoriously hard problem. Considering average case analysis allows for better results. In this work we consider the unif...
Amin Coja-Oghlan, Michael Krivelevich, Dan Vilench...
PAMI
2010
192views more  PAMI 2010»
15 years 2 months ago
Esaliency (Extended Saliency): Meaningful Attention Using Stochastic Image Modeling
Computer-vision attention processes allocate computational resources to different parts of visual input and can lead to faster object recognition and image analysis. This paper p...
Tamar Avraham, Michael Lindenbaum
PE
2010
Springer
170views Optimization» more  PE 2010»
15 years 2 months ago
Approximating passage time distributions in queueing models by Bayesian expansion
We introduce Bayesian Expansion (BE), an approximate numerical technique for passage time distribution analysis in queueing networks. BE uses a class of Bayesian networks to appro...
Giuliano Casale
RV
2010
Springer
172views Hardware» more  RV 2010»
15 years 2 months ago
Recovery Tasks: An Automated Approach to Failure Recovery
Abstract. We present a new approach for developing robust software applications that breaks dependences on the failed parts of an application’s execution to allow the rest of the...
Brian Demsky, Jin Zhou, William Montaz
SCIENTOMETRICS
2010
158views more  SCIENTOMETRICS 2010»
15 years 2 months ago
Rete-netzwerk-red: analyzing and visualizing scholarly networks using the Network Workbench Tool
The enormous increase in digital scholarly data and computing power combined with recent advances in text mining, linguistics, network science, and scientometrics make it possible...
Katy Börner, Weixia Huang, Micah Linnemeier, ...
« Prev « First page 2255 / 2453 Last » Next »