Sciweavers

5221 search results - page 181 / 1045
» An On-line Problem Database
Sort
View
211
Voted
PVLDB
2008
146views more  PVLDB 2008»
15 years 5 months ago
Efficient search for the top-k probable nearest neighbors in uncertain databases
Uncertainty pervades many domains in our lives. Current real-life applications, e.g., location tracking using GPS devices or cell phones, multimedia feature extraction, and sensor...
George Beskales, Mohamed A. Soliman, Ihab F. Ilyas
160
Voted
AI
2011
Springer
15 years 1 months ago
Contracting preference relations for database applications
The binary relation framework has been shown to be applicable to many real-life preference handling scenarios. Here we study preference contraction: the problem of discarding sele...
Denis Mindolin, Jan Chomicki
ICDE
2007
IEEE
97views Database» more  ICDE 2007»
16 years 14 days ago
Service Description and Analysis From a Type Theoretic Approach
In this paper, we propose to deploy type-theoretic techniques to the service description and composition verification. We define a flexible type system for modeling instances a...
Ken Q. Pu
TIME
2007
IEEE
16 years 12 days ago
On Construction of Holistic Synopses under the Duplicate Semantics of Streaming Queries
Transaction-time temporal databases and query languages provide a solid framework for analyzing properties of queries over data streams. In this paper we focus on issues connected...
David Toman
129
Voted
ER
2006
Springer
104views Database» more  ER 2006»
15 years 9 months ago
Evolving the Implementation of ISA Relationships in EER Schemas
Abstract. One of the most severe problems related to database evolution is how to reflect in the data level the changes that have occurred in the conceptual schema of a database. T...
Eladio Domínguez, Jorge Lloret, Angel Luis ...