Sciweavers

2412 search results - page 147 / 483
» Which Problems Have Strongly Exponential Complexity
Sort
View
TACAS
2007
Springer
144views Algorithms» more  TACAS 2007»
15 years 9 months ago
Detecting Races in Ensembles of Message Sequence Charts
Abstract. The analysis of message sequence charts (MSCs) is highly important in preventing common problems in communication protocols. Detecting race conditions, i.e., possible dis...
Edith Elkind, Blaise Genest, Doron Peled
ICC
1997
IEEE
108views Communications» more  ICC 1997»
15 years 7 months ago
Overflow Probability in an ATM Queue with Self-Similar Input Traffic
Real measurements in high-speed communications networks have recently shown that traffic may demonstrate properties of long-range dependency peculiar to self-similar stochastic pr...
Boris Tsybakov, Nicolas D. Georganas
SODA
2008
ACM
184views Algorithms» more  SODA 2008»
15 years 4 months ago
On the approximability of influence in social networks
In this paper, we study the spread of influence through a social network, in a model initially studied by Kempe, Kleinberg and Tardos [14, 15]: We are given a graph modeling a soc...
Ning Chen
CVPR
2003
IEEE
16 years 5 months ago
Joint 3D-Reconstruction and Background Separation in Multiple Views using Graph Cuts
This paper deals with simultaneous depth map estimation and background separation in a multi-view setting with several fixed calibrated cameras, two problems which have previously...
Bastian Goldlücke, Marcus A. Magnor
ICCV
2005
IEEE
16 years 5 months ago
Combining Generative Models and Fisher Kernels for Object Recognition
Learning models for detecting and classifying object categories is a challenging problem in machine vision. While discriminative approaches to learning and classification have, in...
Alex Holub, Max Welling, Pietro Perona