Sciweavers

895 search results - page 50 / 179
» Using graphs for some discrete tomography problems
Sort
View
MOBICOM
2012
ACM
12 years 1 months ago
Temporal reachability graphs
While a natural fit for modeling and understanding mobile networks, time-varying graphs remain poorly understood. Indeed, many of the usual concepts of static graphs have no obvi...
John Whitbeck, Marcelo Dias de Amorim, Vania Conan...
ADBIS
2009
Springer
148views Database» more  ADBIS 2009»
14 years 5 months ago
On Containment of Conjunctive Queries with Negation
Abstract. We consider the problem of query containment for conjunctive queries with the safe negation property. Some necessary conditions for this problem are given. A part of the ...
Victor Felea
SODA
2008
ACM
84views Algorithms» more  SODA 2008»
14 years 11 days ago
Robust cost colorings
We consider graph coloring problems where the cost of a coloring is the sum of the costs of the colors, and the cost of a color is a monotone concave function of the total weight ...
Takuro Fukunaga, Magnús M. Halldórss...
CVPR
2004
IEEE
14 years 2 months ago
Efficient Graphical Models for Processing Images
Graphical models are powerful tools for processing images. However, the large dimensionality of even local image data poses a difficulty: representing the range of possible graphi...
Marshall F. Tappen, Bryan C. Russell, William T. F...
CVPR
2008
IEEE
15 years 29 days ago
Exact inference in multi-label CRFs with higher order cliques
This paper addresses the problem of exactly inferring the maximum a posteriori solutions of discrete multi-label MRFs or CRFs with higher order cliques. We present a framework to ...
Srikumar Ramalingam, Pushmeet Kohli, Karteek Alaha...