Sciweavers

1283 search results - page 173 / 257
» Probabilistic structured query methods
Sort
View
SIGMETRICS
2000
ACM
14 years 1 months ago
An analytical model of the working-set sizes in decision-support systems
This paper presents an analytical model to study how working sets scale with database size and other applications parameters in decision-support systems (DSS). The model uses appl...
Magnus Karlsson, Per Stenström
ESWS
2008
Springer
13 years 11 months ago
The Creation and Evaluation of iSPARQL Strategies for Matchmaking
Abstract. This research explores a new method for Semantic Web service matchmaking based on iSPARQL strategies, which enables to query the Semantic Web with techniques from traditi...
Christoph Kiefer, Abraham Bernstein
ACL
2008
13 years 10 months ago
Searching Questions by Identifying Question Topic and Question Focus
This paper is concerned with the problem of question search. In question search, given a question as query, we are to return questions semantically equivalent or close to the quer...
Huizhong Duan, Yunbo Cao, Chin-Yew Lin, Yong Yu
SODA
2008
ACM
150views Algorithms» more  SODA 2008»
13 years 10 months ago
Finding an optimal tree searching strategy in linear time
We address the extension of the binary search technique from sorted arrays and totally ordered sets to trees and tree-like partially ordered sets. As in the sorted array case, the...
Shay Mozes, Krzysztof Onak, Oren Weimann
ICDT
2011
ACM
232views Database» more  ICDT 2011»
13 years 18 days ago
(Approximate) uncertain skylines
Given a set of points with uncertain locations, we consider the problem of computing the probability of each point lying on the skyline, that is, the probability that it is not do...
Peyman Afshani, Pankaj K. Agarwal, Lars Arge, Kasp...