976 search results - page 71 / 196 » The Complexity of Timetable Construction Problems |
CTRSA
2006
Springer
15 years 1 months ago
2006
Springer
We construct efficient universally composable oblivious transfer protocols in the multi-party setting for honest majorities. Unlike previous proposals our protocols are designed in...
TKDE
2008
14 years 9 months ago
2008
Schema matching is one of the key challenges in information integration. It is a labor-intensive and time-consuming process. To alleviate the problem, many automated solutions have...
106
click to vote
STOC
2004
ACM
15 years 10 months ago
2004
ACM
Abstract. In the late nineties, Erickson proved a remarkable lower bound on the decision tree complexity of one of the central problems of computational geometry: given n numbers, ...
ICDCSW
2007
IEEE
15 years 4 months ago
2007
IEEE
Complex event processing has become increasingly important in modern applications, ranging from supply chain management for RFID tracking to real-time intrusion detection. The goa...
MFCS
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Feige and Kilian [5] showed that finding reasonable approximative solutions to the coloring problem on graphs is hard. This motivates the quest for algorithms that eithe...