Sciweavers

723 search results - page 105 / 145
» Reducing the complexity of the issue logic
Sort
View
ECAI
2008
Springer
13 years 9 months ago
A probabilistic analysis of diagnosability in discrete event systems
Abstract. This paper shows that we can take advantage of information about the probabilities of the occurrences of events, when this information is available, to refine the classic...
Farid Nouioua, Philippe Dague
CVPR
2006
IEEE
14 years 9 months ago
Shape from Shading: Recognizing the Mountains through a Global View
Resolving local ambiguities is an important issue for shape from shading (SFS). Pixel ambiguities of SFS can be eliminated by propagation approaches. However, patch ambiguities st...
Qihui Zhu, Jianbo Shi
DAC
2007
ACM
14 years 8 months ago
Voltage-Frequency Island Partitioning for GALS-based Networks-on-Chip
Due to high levels of integration and complexity, the design of multi-core SoCs has become increasingly challenging. In particular, energy consumption and distributing a single gl...
Ümit Y. Ogras, Diana Marculescu, Puru Choudha...
SIGMOD
2002
ACM
114views Database» more  SIGMOD 2002»
14 years 7 months ago
Time-parameterized queries in spatio-temporal databases
Time-parameterized queries (TP queries for short) retrieve (i) the actual result at the time that the query is issued, (ii) the validity period of the result given the current mot...
Yufei Tao, Dimitris Papadias
HPDC
2009
IEEE
14 years 2 months ago
Pluggable parallelisation
This paper presents the concept of pluggable parallelisation that allows scientists to develop “sequential like” codes that can take advantage of multi-core, cluster and grid ...
Rui C. Gonçalves, João Luís S...