Sciweavers

254 search results - page 35 / 51
» Deterministic Soliton Graphs
Sort
View
CORR
2008
Springer
138views Education» more  CORR 2008»
14 years 9 months ago
Computing Minimum Spanning Trees with Uncertainty
Abstract. We consider the minimum spanning tree problem in a setting where information about the edge weights of the given graph is uncertain. Initially, for each edge e of the gra...
Thomas Erlebach, Michael Hoffmann 0002, Danny Kriz...
ICIP
2009
IEEE
15 years 10 months ago
Hierarchical Region-based Representation For Segmentation And Filtering With Depth In Single Images
This paper presents an algorithm for tree-based representation of single images and its applications to segmentation and filtering with depth. In a our recent work, we have addres...
STOC
2004
ACM
153views Algorithms» more  STOC 2004»
15 years 9 months ago
Quantum and classical query complexities of local search are polynomially related
Let f be an integer valued function on a finite set V . We call an undirected graph G(V, E) a neighborhood structure for f. The problem of finding a local minimum for f can be phr...
Miklos Santha, Mario Szegedy
CCS
2007
ACM
15 years 3 months ago
Analyzing the vulnerability of superpeer networks against attack
In this paper, we develop an analytical framework to measure the vulnerability of superpeer networks against attack. Two different kinds of attacks namely deterministic and degre...
Bivas Mitra, Fernando Peruani, Sujoy Ghose, Niloy ...
CPAIOR
2007
Springer
15 years 3 months ago
Modeling the Regular Constraint with Integer Programming
Many optimisation problems contain substructures involving constraints on sequences of decision variables. Such constraints can be very complex to express with mixed integer progra...
Marie-Claude Côté, Bernard Gendron, L...