8370 search results - page 1276 / 1674 » Challenges in P2P Computing |
205
click to vote
PCM
2005
Springer
16 years 9 days ago
2005
Springer
In general, motion compensated (MC) deinterlacing algorithms can outperform non-MC (NMC) ones. However, we often prefer to choose the latter due to the considerations of error prop...
180
click to vote
PKDD
2005
Springer
16 years 9 days ago
2005
Springer
Abstract. Most real-world datasets are, to a certain degree, skewed. When considered that they are also large, they become the pinnacle challenge in data analysis. More importantly...
173
click to vote
SAMOS
2005
Springer
16 years 9 days ago
2005
Springer
The design of appropriate communication architectures for complex Systems-on-Chip (SoC) is a challenging task. One promising alternative to solve these problems are Networks-on-Chi...
184
click to vote
SG
2005
Springer
16 years 9 days ago
2005
Springer
Abstract. During the last decade research groups as well as a number of commercial software developers have started to deploy embodied conversational characters in the user interfa...
182
click to vote
SLSFS
2005
Springer
16 years 9 days ago
2005
Springer
Abstract. Matrix factorization is a fundamental building block in many computer vision and machine learning algorithms. In this work we focus on the problem of ”structure from mo...