Sciweavers

1968 search results - page 215 / 394
» The Complexity of Valued Constraint Models
Sort
View
DAM
2006
116views more  DAM 2006»
15 years 1 months ago
Using graphs for some discrete tomography problems
Given a rectangular array where entries represent the pixels of a digitalized image, we consider the problem of reconstructing an image from the number of occurrences of each colo...
Marie-Christine Costa, Dominique de Werra, Christo...
88
Voted
TWEB
2008
66views more  TWEB 2008»
15 years 1 months ago
An environment for flexible advanced compensations of Web service transactions
tions at runtime. We introduce the abstract service and adapter components which allow us to separate the compensation logic from the coordination logic. In this way, we can easily...
Michael Schäfer, Peter Dolog, Wolfgang Nejdl
ECAI
2010
Springer
14 years 11 months ago
Learning conditionally lexicographic preference relations
Abstract. We consider the problem of learning a user's ordinal preferences on a multiattribute domain, assuming that her preferences are lexicographic. We introduce a general ...
Richard Booth, Yann Chevaleyre, Jérôm...
CVPR
2006
IEEE
16 years 3 months ago
Dynamics Based Robust Motion Segmentation
In this paper we consider the problem of segmenting multiple rigid motions using multi?frame point correspondence data. The main idea of the method is to group points according to...
Roberto Lublinerman, Mario Sznaier, Octavia I. Cam...
CCGRID
2008
IEEE
15 years 8 months ago
A Stochastic Programming Approach for QoS-Aware Service Composition
—We formulate the service composition problem as a multi-objective stochastic program which simultaneously optimizes the following quality of service (QoS) parameters: workflow ...
Wolfram Wiesemann, Ronald Hochreiter, Daniel Kuhn