2877 search results - page 332 / 576 » The Complexity of Planarity Testing |
167
click to vote
CIG
2005
IEEE
16 years 11 days ago
2005
IEEE
This paper follows on from our previous work focused on formulating an efficient generic measure of user’s satisfaction (‘interest’) when playing predator/prey games. Viewin...
185
click to vote
ICCV
2005
IEEE
16 years 11 days ago
2005
IEEE
We propose an algorithm to perform causal inference of the state of a dynamical model when the measurements are corrupted by outliers. While the optimal (maximumlikelihood) soluti...
177
click to vote
RSP
2005
IEEE
16 years 10 days ago
2005
IEEE
Nowadays, Architecture Description Languages (ADLs) are getting popular to speed up the development of complex SoC design, by performing the design space explon a higher level of ...
187
click to vote
ISCIS
2005
Springer
16 years 7 days ago
2005
Springer
Dense subgraphs of sparse graphs (communities), which appear in most real-world complex networks, play an important role in many contexts. Computing them however is generally expe...
204
click to vote
PCM
2005
Springer
16 years 7 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...