Sciweavers

1144 search results - page 122 / 229
» Feasibility Studies
Sort
View
EUROCRYPT
2003
Springer
14 years 2 months ago
On the Limitations of Universally Composable Two-Party Computation without Set-up Assumptions
The recently proposed universally composable (UC) security framework for analyzing security of cryptographic protocols provides very strong security guarantees. In particular, a p...
Ran Canetti, Eyal Kushilevitz, Yehuda Lindell
ACSC
2006
IEEE
14 years 3 months ago
Using formal concept analysis with an incremental knowledge acquisition system for web document management
It is necessary to provide a method to store Web information effectively so it can be utilised as a future knowledge resource. A commonly adopted approach is to classify the retri...
Timothy J. Everts, Sung Sik Park, Byeong Ho Kang
ASPLOS
2009
ACM
14 years 29 days ago
Efficient online validation with delta execution
Software systems are constantly changing. Patches to fix bugs and patches to add features are all too common. Every change risks breaking a previously working system. Hence admini...
Joseph Tucek, Weiwei Xiong, Yuanyuan Zhou
LREC
2010
206views Education» more  LREC 2010»
13 years 10 months ago
Efficient Multilabel Classification Algorithms for Large-Scale Problems in the Legal Domain
In this paper we evaluate the performance of multilabel classification algorithms on the EUR-Lex database of legal documents of the European Union. On the same set of underlying d...
Eneldo Loza Mencía, Johannes Fürnkranz
CP
2000
Springer
14 years 1 months ago
Optimal Anytime Constrained Simulated Annealing for Constrained Global Optimization
Abstract. In this paper we propose an optimal anytime version of constrained simulated annealing (CSA) for solving constrained nonlinear programming problems (NLPs). One of the goa...
Benjamin W. Wah, Yixin Chen