Sciweavers

11963 search results - page 2258 / 2393
» A framework for linguistic modelling
Sort
View
CLEANDB
2006
ACM
142views Database» more  CLEANDB 2006»
14 years 12 months ago
QUEST: QUery-driven Exploration of Semistructured Data with ConflicTs and Partial Knowledge
An important reality when integrating scientific data is the fact that data may often be "missing", partially specified, or conflicting. Therefore, in this paper, we pre...
Yan Qi 0002, K. Selçuk Candan, Maria Luisa ...
DEBS
2008
ACM
14 years 11 months ago
Event-based constraints for sensornet programming
We propose a sensornet programming model based on declarative spatio-temporal constraints on events only, not sensors. Where previous approaches conflate events and sensors becaus...
Jie Mao, John Jannotti, Mert Akdere, Ugur Ç...
AAAI
1998
14 years 11 months ago
Probabilistic Frame-Based Systems
Two of the most important threads of work in knowledge representation today are frame-based representation systems (FRS's) and Bayesian networks (BNs). FRS's provide an ...
Daphne Koller, Avi Pfeffer
IOPADS
1997
152views more  IOPADS 1997»
14 years 11 months ago
Competitive Parallel Disk Prefetching and Buffer Management
We provide a competitive analysis framework for online prefetching and buffer management algorithms in parallel I/O systems, using a read-once model of block references. This has ...
Rakesh D. Barve, Mahesh Kallahalla, Peter J. Varma...
COLING
1996
14 years 11 months ago
Computational Complexity of Probabilistic Disambiguation by means of Tree-Grammars
This paper studies the computational complexity of disambiguation under probabilistic tree-grammars as in (Bod, 1992; Schabes and Waters, 1993). It presents a proof that the follo...
Khalil Sima'an
« Prev « First page 2258 / 2393 Last » Next »