Sciweavers

268 search results - page 50 / 54
» Cleaning Interval Graphs
Sort
View
IFIPTM
2009
109views Management» more  IFIPTM 2009»
14 years 7 months ago
Elimination of Subjectivity from Trust Recommendation
In many distributed applications, a party who wishes to make a transaction requires that it has a certain level of trust in the other party. It is frequently the case that the part...
Omar Hasan, Lionel Brunie, Jean-Marc Pierson, Elis...
GRAPHICSINTERFACE
2008
14 years 11 months ago
Background estimation from non-time sequence images
We address the problem of reconstructing the background of a scene from a set of photographs featuring several occluding objects. We assume that the photographs are obtained from ...
Miguel Granados, Hans-Peter Seidel, Hendrik P. A. ...
CATS
2008
14 years 11 months ago
Tractable Cases of the Extended Global Cardinality Constraint
We study the consistency problem for extended global cardinality (EGC) constraints. An EGC constraint consists of a set X of variables, a set D of values, a domain D(x) D for eac...
Marko Samer, Stefan Szeider
SODA
2008
ACM
105views Algorithms» more  SODA 2008»
14 years 11 months ago
Deterministic random walks on regular trees
Jim Propp's rotor router model is a deterministic analogue of a random walk on a graph. Instead of distributing chips randomly, each vertex serves its neighbors in a fixed or...
Joshua N. Cooper, Benjamin Doerr, Tobias Friedrich...
EUROSYS
2010
ACM
15 years 4 months ago
PUSH: A Dataflow Shell
The deluge of huge data sets such as those provided by sensor networks, online transactions, and the web provide exciting opportunities for data analysis. The scale of the data ...
Noah Evans, Eric Van Hensbergen