Sciweavers

2043 search results - page 265 / 409
» The Limits of Querying Ontologies
Sort
View
COLT
2008
Springer
13 years 11 months ago
Learning Acyclic Probabilistic Circuits Using Test Paths
We define a model of learning probabilistic acyclic circuits using value injection queries, in which an arbitrary subset of wires is set to fixed values, and the value on the sing...
Dana Angluin, James Aspnes, Jiang Chen, David Eise...
DCOSS
2008
Springer
13 years 11 months ago
An Information Theoretic Framework for Field Monitoring Using Autonomously Mobile Sensors
We consider a mobile sensor network monitoring a spatio-temporal field. Given limited caches at the sensor nodes, the goal is to develop a distributed cache management algorithm to...
Hany Morcos, George Atia, Azer Bestavros, Ibrahim ...
PVLDB
2010
149views more  PVLDB 2010»
13 years 7 months ago
GRAIL: Scalable Reachability Index for Large Graphs
Given a large directed graph, rapidly answering reachability queries between source and target nodes is an important problem. Existing methods for reachability trade-off indexing ...
Hilmi Yildirim, Vineet Chaoji, Mohammed Javeed Zak...
CIKM
2010
Springer
13 years 7 months ago
From exploratory search to web search and back
The power of search is with no doubt one of the main aspects for the success of the Web. Currently available search engines on the Web allow to return results with a high precisio...
Roberto Mirizzi, Tommaso Di Noia
DEXA
2009
Springer
176views Database» more  DEXA 2009»
13 years 7 months ago
Analyzing Document Retrievability in Patent Retrieval Settings
Most information retrieval settings, such as web search, are typically precision-oriented, i.e. they focus on retrieving a small number of highly relevant documents. However, in sp...
Shariq Bashir, Andreas Rauber