Sciweavers

8437 search results - page 1372 / 1688
» Preferences over Sets
Sort
View
STACS
2007
Springer
16 years 27 days ago
Reachability in Unions of Commutative Rewriting Systems Is Decidable
We consider commutative string rewriting systems (Vector Addition Systems, Petri nets), i.e., string rewriting systems in which all pairs of letters commute. We are interested in r...
Mikolaj Bojanczyk, Piotr Hoffman
STOC
2009
ACM
168views Algorithms» more  STOC 2009»
16 years 7 months ago
Fault-tolerant spanners for general graphs
The paper concerns graph spanners that are resistant to vertex or edge failures. Given a weighted undirected n-vertex graph G = (V, E) and an integer k 1, the subgraph H = (V, E ...
Shiri Chechik, Michael Langberg, David Peleg, Liam...
DM
1998
195views more  DM 1998»
15 years 6 months ago
On basis-exchange properties for matroids
We give a counterexample to a conjecture by Wild about binary matroids. We connect two equivalent lines of research in matroid theory: a simple type of basis-exchange property and ...
Joseph E. Bonin
CVPR
2004
IEEE
16 years 8 months ago
Spatially Coherent Clustering Using Graph Cuts
Feature space clustering is a popular approach to image segmentation, in which a feature vector of local properties (such as intensity, texture or motion) is computed at each pixe...
Ramin Zabih, Vladimir Kolmogorov
CVPR
2005
IEEE
16 years 8 months ago
Bayesian Object Detection in Dynamic Scenes
Detecting moving objects using stationary cameras is an important precursor to many activity recognition, object recognition and tracking algorithms. In this paper, three innovati...
Yaser Sheikh, Mubarak Shah
« Prev « First page 1372 / 1688 Last » Next »