Sciweavers

2629 search results - page 111 / 526
» complex 2009
Sort
View
87
Voted
IAT
2009
IEEE
15 years 7 months ago
Computing Information Minimal Match Explanations for Logic-Based Matchmaking
Abstract—In semantic matchmaking processes it is often useful, when the obtained match is not full, to provide explanations for the mismatch, to leverage further interaction and/...
Tommaso Di Noia, Eugenio Di Sciascio, Francesco M....
75
Voted
ICIP
2009
IEEE
16 years 1 months ago
Fast One-pass Motion Compensated Frame Interpolation In High-definition Video Processing
In this paper, a fast one-pass processing method with an efficient architecture is proposed for motion compensated frame interpolation (MCFI) in high-definition (HD) videos. Unlik...
ICLP
2009
Springer
16 years 1 months ago
Finding Similar or Diverse Solutions in Answer Set Programming
We study finding similar or diverse solutions of a given computational problem, in answer set programming, and introduce offline methods and online methods to compute them using an...
Thomas Eiter, Esra Erdem, Halit Erdogan, Michael F...
73
Voted
CHI
2009
ACM
16 years 1 months ago
Understanding teamwork in high-risk domains through analysis of errors
Trauma care is an example of dynamic, complex, and safety-critical teamwork. The staff in trauma centers works under time pressure and lacks effective information technologies to ...
Aleksandra Sarcevic
91
Voted
TCC
2009
Springer
131views Cryptology» more  TCC 2009»
16 years 1 months ago
Complete Fairness in Multi-party Computation without an Honest Majority
Gordon et al. recently showed that certain (non-trivial) functions can be computed with complete fairness in the two-party setting. Motivated by their results, we initiate a study...
S. Dov Gordon, Jonathan Katz