Sciweavers

4539 search results - page 362 / 908
» Approaches to Compute Workflow Complexity
Sort
View
ICNS
2008
IEEE
16 years 1 months ago
DiProNN: Distributed Programmable Network Node Architecture
The programmable network approach allows processing of passing user data in a network, which is highly suitable especially for multimedia streams processing. However, programming ...
Tomás Rebok
TOG
2002
118views more  TOG 2002»
15 years 6 months ago
Frequency space environment map rendering
We present a new method for real-time rendering of objects with complex isotropic BRDFs under distant natural illumination, as specified by an environment map. Our approach is bas...
Ravi Ramamoorthi, Pat Hanrahan
CORR
2010
Springer
136views Education» more  CORR 2010»
15 years 4 months ago
Schaefer's theorem for graphs
Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem ...
Manuel Bodirsky, Michael Pinsker
208
Voted
ECCV
2006
Springer
16 years 8 months ago
Learning Compositional Categorization Models
Abstract. This contribution proposes a compositional approach to visual object categorization of scenes. Compositions are learned from the Caltech 101 database1 intermediate abstra...
Björn Ommer, Joachim M. Buhmann
ICIP
2004
IEEE
16 years 8 months ago
Learning structured dictionaries for image representation
The dictionary approach to signal and image processing has been massively investigated in the last two decades, proving very attractive for a wide range of applications. The effec...
Gianluca Monaci, Pierre Vandergheynst