Sciweavers

1291 search results - page 117 / 259
» Computing the multiplicity structure in solving polynomial s...
Sort
View
PODC
2010
ACM
15 years 3 months ago
Brief announcement: efficient graph algorithms without synchronization
We give a graph decomposition technique that creates entirely independent subproblems for graph problems such as coloring and dominating sets that can be solved without synchroniz...
Johannes Schneider, Roger Wattenhofer
CVPR
2003
IEEE
16 years 3 months ago
Using Many Cameras as One
We illustrate how to consider a network of cameras as a single generalized camera in a framework proposed by Nayar [13]. We derive the discrete structure from motion equations for...
Robert Pless
MOR
2008
169views more  MOR 2008»
15 years 1 months ago
The Flow Set with Partial Order
The flow set with partial order is a mixed-integer set described by a budget on total flow and a partial order on the arcs that may carry positive flow. This set is a common substr...
Alper Atamtürk, Muhong Zhang
QEST
2010
IEEE
14 years 11 months ago
Symblicit Calculation of Long-Run Averages for Concurrent Probabilistic Systems
Abstract--Model checkers for concurrent probabilistic systems have become very popular within the last decade. The study of long-run average behavior has however received only scan...
Ralf Wimmer, Bettina Braitling, Bernd Becker, Erns...
JMLR
2008
150views more  JMLR 2008»
15 years 1 months ago
Discriminative Learning of Max-Sum Classifiers
The max-sum classifier predicts n-tuple of labels from n-tuple of observable variables by maximizing a sum of quality functions defined over neighbouring pairs of labels and obser...
Vojtech Franc, Bogdan Savchynskyy