Sciweavers

2125 search results - page 292 / 425
» On Graph Complexity
Sort
View
88
Voted
MIRAGE
2007
Springer
15 years 4 months 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
IEEECIT
2006
IEEE
15 years 4 months 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»
15 years 4 months 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
15 years 3 months 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
CP
2005
Springer
15 years 3 months ago
Allocation and Scheduling for MPSoCs via Decomposition and No-Good Generation
This paper describes an efficient, complete approach for solving a complex allocation and scheduling problem for Multi-Processor System-on-Chip (MPSoC). Given a throughput constra...
Luca Benini, Davide Bertozzi, Alessio Guerri, Mich...