Sciweavers

5100 search results - page 647 / 1020
» The Linear Complexity of a Graph
Sort
View
MIRAGE
2007
Springer
16 years 25 days ago
Segmentation of Soft Shadows Based on a Daylight- and Penumbra Model
Abstract. This paper introduces a new concept within shadow segmentation for usage in shadow removal and augmentation through construction of an alpha overlay shadow model. Previou...
Michael Nielsen, Claus B. Madsen
NETCOOP
2007
Springer
16 years 25 days ago
Tracing an Optical Buffer's Performance: An Effective Approach
Abstract. Optical Burst Switching proposes a future-proof alternative to the current electronic switching in the backbone. The involved optical buffers are implemented with a set o...
Wouter Rogiest, Dieter Fiems, Koenraad Laevens, He...
IEEECIT
2006
IEEE
16 years 22 days ago
Generic Modeling and Annotation of the Dance Video Semantics
Dance is the real cultural wealth of any nation and dance media is the source for learning the dance steps by the present and future generation of students. Dance videos exhibit r...
Balakrishnan Ramadoss, Kannan Rajkumar
ISMVL
2006
IEEE
109views Hardware» more  ISMVL 2006»
16 years 22 days ago
Towards Solving Many-Valued MaxSAT
We define the MaxSAT problem for many-valued CNF formulas, called many-valued MaxSAT, and establish its complexity class. We then describe a basic branch and bound algorithm for ...
Josep Argelich, Xavier Domingo, Chu Min Li, Felip ...
SOFTVIS
2005
ACM
16 years 8 days ago
Adding parallelism to visual data flow programs
Programming in parallel is an error-prone and complex task compounded by the lack of tool support for both programming and debugging. Recent advances in compiler-directed shared m...
Philip T. Cox, Simon Gauvin, Andrew Rau-Chaplin