Sciweavers

8695 search results - page 111 / 1739
» Making the Complex Simple
Sort
View
GIS
2010
ACM
13 years 8 months ago
Topological reasoning between complex regions in databases with frequent updates
Reasoning about space has been a considerable field of study both in Artificial Intelligence and in spatial information theory. Many applications benefit from the inference of ...
Arif Khan, Markus Schneider
ISAAC
2009
Springer
169views Algorithms» more  ISAAC 2009»
14 years 4 months ago
The Complexity of Solving Stochastic Games on Graphs
We consider some well-known families of two-player zero-sum perfect-information stochastic games played on finite directed graphs. Generalizing and unifying results of Liggett and...
Daniel Andersson, Peter Bro Miltersen
JCT
2008
132views more  JCT 2008»
13 years 9 months ago
The absolute order on the symmetric group, constructible partially ordered sets and Cohen-Macaulay complexes
The absolute order is a natural partial order on a Coxeter group W. It can be viewed as an analogue of the weak order on W in which the role of the generating set of simple reflec...
Christos A. Athanasiadis, Myrto Kallipoliti
ICCV
2007
IEEE
14 years 11 months ago
Non-Parametric Probabilistic Image Segmentation
We propose a simple probabilistic generative model for image segmentation. Like other probabilistic algorithms (such as EM on a Mixture of Gaussians) the proposed model is princip...
Marco Andreetto, Lihi Zelnik-Manor, Pietro Perona
ESA
2009
Springer
127views Algorithms» more  ESA 2009»
14 years 4 months ago
Maximum Flow in Directed Planar Graphs with Vertex Capacities
In this paper we present an O(n log n) algorithm for finding a maximum flow in a directed planar graph, where the vertices are subject to capacity constraints, in addition to the...
Haim Kaplan, Yahav Nussbaum