1688 search results - page 162 / 338 » The Complexity of Rationalizing Matchings |
156
click to vote
WECWIS
2006
IEEE
15 years 12 months ago
2006
IEEE
This paper describes a software solution for the WSChallenge 2006. We introduce the MOVE framework that has been applied to this challenge. Also, the architecture, algorithms, and...
135
click to vote
MM
2005
ACM
15 years 11 months ago
2005
ACM
“diorama table “ is an interactive table installation. People place physical objects on the table and projected elements such as trains, cars, houses, and trees appear and are...
182
click to vote
ASIACRYPT
2005
Springer
15 years 11 months ago
2005
Springer
We propose Gate Evaluation Secret Sharing (GESS) – a new kind of secret sharing, designed for use in secure function evaluation (SFE) with minimal interaction. The resulting simp...
170
click to vote
IWSOC
2003
IEEE
15 years 11 months ago
2003
IEEE
The new technology of reconfigurable System-on-Chip is shown to be a good match to the requirements of realtime embedded systems. In particular, the judicious use of specialised d...
164
click to vote
COMPGEOM
2003
ACM
15 years 11 months ago
2003
ACM
Given a polygonal curve and a geometric graph, we describe an efficient algorithm to find a path in the graph which is most similar to the curve, using the well-known Fr´echet d...