Sciweavers

644 search results - page 119 / 129
» Decomposition Complexity
Sort
View
IEEEPACT
2005
IEEE
15 years 3 months ago
HUNTing the Overlap
Hiding communication latency is an important optimization for parallel programs. Programmers or compilers achieve this by using non-blocking communication primitives and overlappi...
Costin Iancu, Parry Husbands, Paul Hargrove
MM
2005
ACM
140views Multimedia» more  MM 2005»
15 years 3 months ago
Topic transition detection using hierarchical hidden Markov and semi-Markov models
In this paper we introduce a probabilistic framework to exploit hierarchy, structure sharing and duration information for topic transition detection in videos. Our probabilistic d...
Dinh Q. Phung, Thi V. Duong, Svetha Venkatesh, Hun...
CAISE
2005
Springer
15 years 3 months ago
Dynamic Load Balancing of Virtualized Database Services Using Hints and Load Forecasting
Abstract. Future database application systems will be designed as Service Oriented Architectures (SOAs), in contrast to today’s monolithic architectures. The decomposition in man...
Daniel Gmach, Stefan Krompass, Stefan Seltzsam, Ma...
KDD
2005
ACM
178views Data Mining» more  KDD 2005»
15 years 3 months ago
Failure detection and localization in component based systems by online tracking
The increasing complexity of today’s systems makes fast and accurate failure detection essential for their use in mission-critical applications. Various monitoring methods provi...
Haifeng Chen, Guofei Jiang, Cristian Ungureanu, Ke...
RT
2005
Springer
15 years 3 months ago
Estimation of 3D Faces and Illumination from Single Photographs Using A Bilinear Illumination Model
3D Face modeling is still one of the biggest challenges in computer graphics. In this paper we present a novel framework that acquires the 3D shape, texture, pose and illumination...
Jinho Lee, Hanspeter Pfister, Baback Moghaddam, Ra...