Sciweavers

1963 search results - page 112 / 393
» Applications of Preferences using Answer Set Programming
Sort
View
ICDE
2009
IEEE
214views Database» more  ICDE 2009»
16 years 4 months ago
Ranking with Uncertain Scores
Large databases with uncertain information are becoming more common in many applications including data integration, location tracking, and Web search. In these applications, ranki...
Mohamed A. Soliman, Ihab F. Ilyas
ICDE
2009
IEEE
148views Database» more  ICDE 2009»
16 years 4 months ago
Online Interval Skyline Queries on Time Series
In many applications, we need to analyze a large number of time series. Segments of time series demonstrating dominating advantages over others are often of particular interest. In...
Bin Jiang, Jian Pei
ICDE
2008
IEEE
130views Database» more  ICDE 2008»
16 years 4 months ago
Efficient Computation of Diverse Query Results
We study the problem of efficiently computing diverse query results in online shopping applications, where users specify queries through a form interface that allows a mix of stru...
Erik Vee, Utkarsh Srivastava, Jayavel Shanmugasund...
ACTAC
2002
102views more  ACTAC 2002»
15 years 3 months ago
Handling Pointers and Unstructured Statements in the Forward Computed Dynamic Slice Algorithm
Different program slicing methods are used for debugging, testing, reverse engineering and maintenance. Slicing algorithms can be classified as a static slicing or dynamic slicing...
Csaba Faragó, Tamás Gergely
EDBT
2009
ACM
113views Database» more  EDBT 2009»
15 years 10 months ago
Query ranking in probabilistic XML data
Twig queries have been extensively studied as a major fragment of XPATH queries to query XML data. In this paper, we study PXMLRANK query, (Q, k), which is to rank top-k probabili...
Lijun Chang, Jeffrey Xu Yu, Lu Qin