Sciweavers

3305 search results - page 154 / 661
» Can we Rely on SQL
Sort
View
COLING
2002
13 years 10 months ago
Recovering Latent Information in Treebanks
Many recent statistical parsers rely on a preprocessing step which uses hand-written, corpus-specific rules to augment the training data with extra information. For example, head-...
David Chiang, Daniel M. Bikel
DLOG
2010
13 years 8 months ago
Optimal Rewritings in Definitorially Complete Description Logics
In this paper, we revisit the problem of definitorial completeness, i.e., whether a given general TBox T in a description logic (DL) L can be rewritten to an acyclic TBox T in L . ...
Inanç Seylan, Enrico Franconi, Jos de Bruij...
MASS
2010
160views Communications» more  MASS 2010»
13 years 8 months ago
Dynamic operator replacement in sensor networks
We present an integrated approach for supporting in-network sensor data processing in dynamic and heterogeneous sensor networks. The concept relies on data stream processing techni...
Moritz Striibe, Michael Daum, Rüdiger Kapitza...
CSFW
2012
IEEE
12 years 24 days ago
Secure Compilation to Modern Processors
—We present a secure (fully abstract) compilation scheme to compile an object-based high-level language to lowchine code. Full abstraction is achieved by relying on a fine-grain...
Pieter Agten, Raoul Strackx, Bart Jacobs, Frank Pi...
AROBOTS
2007
159views more  AROBOTS 2007»
13 years 10 months ago
Structure-based color learning on a mobile robot under changing illumination
— A central goal of robotics and AI is to be able to deploy an agent to act autonomously in the real world over an extended period of time. To operate in the real world, autonomo...
Mohan Sridharan, Peter Stone