Sciweavers

451 search results - page 13 / 91
» Relationless Completeness and Separations
Sort
View
81
Voted
IJFCS
2006
111views more  IJFCS 2006»
14 years 9 months ago
Completeness and realizability: conditions for automatic generation of workflows
In recent years, workflow technology has greatly facilitated business process modeling and reengineering in information systems. On one hand, the separation of an application'...
Shiyong Lu, Arthur J. Bernstein, Philip M. Lewis
73
Voted
ECCV
2008
Springer
15 years 11 months ago
Calibration from Statistical Properties of the Visual World
What does a blind entity need in order to determine the geometry of the set of photocells that it carries through a changing lightfield? In this paper, we show that very crude know...
Etienne Grossmann, José António Gasp...
APPROX
2009
Springer
153views Algorithms» more  APPROX 2009»
15 years 4 months ago
Average-Case Analyses of Vickrey Costs
We explore the average-case “Vickrey” cost of structures in a random setting: the Vickrey cost of a shortest path in a complete graph or digraph with random edge weights; the V...
Prasad Chebolu, Alan M. Frieze, Páll Melste...
TIT
2008
103views more  TIT 2008»
14 years 9 months ago
Fast Distributed Algorithms for Computing Separable Functions
The problem of computing functions of values at the nodes in a network in a fully distributed manner, where nodes do not have unique identities and make decisions based only on loc...
Damon Mosk-Aoyama, Devavrat Shah
IMAGING
2000
14 years 11 months ago
Spectral-Based Six-Color Separation Minimizing Metamerism
A spectral-based six-color printer model was derived in determining the six color separations for an input spectral image that yields the least metameric reproduction relative to ...
Di-yuan Tzeng, Roy S. Berns