Sciweavers

862 search results - page 6 / 173
» Generalized Variational Relation Problems with Applications
Sort
View
MOR
2000
162views more  MOR 2000»
13 years 8 months ago
Approximation Algorithms for Disjoint Paths and Related Routing and Packing Problems
Given a network and a set of connection requests on it, we consider the maximum edge-disjoint paths and related generalizations and routing problems that arise in assigning paths f...
Alok Baveja, Aravind Srinivasan
AAAI
2011
12 years 8 months ago
Sparse Matrix-Variate t Process Blockmodels
We consider the problem of modeling network interactions and identifying latent groups of network nodes. This problem is challenging due to the facts i) that the network nodes are...
Zenglin Xu, Feng Yan, Yuan Qi
ESA
1997
Springer
93views Algorithms» more  ESA 1997»
14 years 22 days ago
Quasi-Fully Dynamic Algorithms for Two-Connectivity, Cycle Equivalence and Related Problems
In thispaper we introduce a new class of dynamicgraphalgorithmscalledquasi-fully dynamic algorithms,which are much more general than the backtracking algorithmsand are much simple...
Madhukar R. Korupolu, Vijaya Ramachandran
ICCV
2007
IEEE
14 years 10 months ago
A Matte-less, Variational Approach to Automatic Scene Compositing
In this paper, we consider the problem of compositing a scene from multiple images. Multiple images, for example, can be obtained by varying the exposure of the camera, by changin...
Shanmuganathan Raman, Subhasis Chaudhuri
STACS
2010
Springer
14 years 1 months ago
A Dichotomy Theorem for the General Minimum Cost Homomorphism Problem
Abstract. In the constraint satisfaction problem (CSP), the aim is to find an assignment of values to a set of variables subject to specified constraints. In the minimum cost hom...
Rustem Takhanov