Sciweavers

56 search results - page 11 / 12
» Asking Queries about Frames
Sort
View
CIARP
2003
Springer
13 years 9 months ago
Uniclass and Multiclass Connectionist Classification of Dialogue Acts
Classification problems are traditionally focused on uniclass samples, that is, each sample of the training and test sets has one unique label, which is the target of the classific...
María José Castro Bleda, David Vilar...
SIGMOD
2004
ACM
165views Database» more  SIGMOD 2004»
14 years 6 months ago
Industrial-Strength Schema Matching
Schema matching identifies elements of two given schemas that correspond to each other. Although there are many algorithms for schema matching, little has been written about build...
Philip A. Bernstein, Sergey Melnik, Michalis Petro...
IMA
2009
Springer
139views Cryptology» more  IMA 2009»
14 years 16 days ago
Security of Cyclic Double Block Length Hash Functions
Abstract. We provide the first proof of security for Abreast-DM, one of the oldest and most wellknown constructions for turning a block cipher with n-bit block length and 2n-bit k...
Ewan Fleischmann, Michael Gorski, Stefan Lucks
TACAS
2007
Springer
165views Algorithms» more  TACAS 2007»
14 years 3 days ago
Multi-objective Model Checking of Markov Decision Processes
We study and provide efficient algorithms for multi-objective model checking problems for Markov Decision Processes (MDPs). Given an MDP, M, and given multiple linear-time (ω-regu...
Kousha Etessami, Marta Z. Kwiatkowska, Moshe Y. Va...
ASIAN
2004
Springer
180views Algorithms» more  ASIAN 2004»
13 years 11 months ago
Counting by Coin Tossings
Abstract. This text is an informal review of several randomized algorithms that have appeared over the past two decades and have proved instrumental in extracting efficiently quant...
Philippe Flajolet