Sciweavers

17018 search results - page 81 / 3404
» From the How to the What
Sort
View
ICGI
2010
Springer
13 years 7 months ago
Rademacher Complexity and Grammar Induction Algorithms: What It May (Not) Tell Us
Abstract. This paper revisits a problem of the evaluation of computational grammatical inference (GI) systems and discusses what role complexity measures can play for the assessmen...
Sophia Katrenko, Menno van Zaanen
SIGMOD
2006
ACM
105views Database» more  SIGMOD 2006»
14 years 9 months ago
Why is schema matching tough and what can we do about it?
In this paper we analyze the problem of schema matching, explain why it is such a "tough" problem and suggest directions for handling it effectively. In particular, we p...
Avigdor Gal
DATE
2007
IEEE
97views Hardware» more  DATE 2007»
14 years 3 months ago
What if you could design tomorrow's system today?
—This paper highlights a series of proven concepts aimed at facilitating the design of next generation systems. Practical system design examples are examined and provide insight ...
Neal Wingen
PADS
1997
ACM
14 years 1 months ago
The Dark Side of Risk (what your mother never told you about Time Warp)
This paper is a reminder of the danger of allowing \risk" when synchronizing a parallel discrete-event simulation: a simulation code that runs correctly on a serial machine m...
David M. Nicol, X. Liu
ISN
1998
Springer
14 years 20 days ago
See What You Sign: Secure Implementations of Digital Signatures
An expectation of a signature system is that a signatory cannot dispute a signature. Aiming at this, the following questions arise: Can documents in electronic commerce on the Inte...
Arnd Weber