Sciweavers

562 search results - page 8 / 113
» Ordered Sets in the Calculus of Data Structures
Sort
View
ICDE
2007
IEEE
119views Database» more  ICDE 2007»
15 years 4 months ago
Practical Preference Relations for Large Data Sets
User-defined preferences allow personalized ranking of query results. A user provides a declarative specification of his/her preferences, and the system is expected to use that ...
Kenneth A. Ross, Peter J. Stuckey, Amélie M...
BMCBI
2010
112views more  BMCBI 2010»
14 years 9 months ago
PhenoFam-gene set enrichment analysis through protein structural information
Background: With the current technological advances in high-throughput biology, the necessity to develop tools that help to analyse the massive amount of data being generated is e...
Maciej Paszkowski-Rogacz, Mikolaj Slabicki, M. Ter...
DCC
2000
IEEE
15 years 2 months ago
Summary Structures for Frequency Queries on Large Transaction Sets
As large-scale databases become commonplace, there has been signi cant interest in mining them for commercial purposes. One of the basic tasks that underlies many of these mining ...
Dow-Yung Yang, Akshay Johar, Ananth Grama, Wojciec...
ICIP
2010
IEEE
14 years 7 months ago
Comparison of merging orders and pruning strategies for Binary Partition Tree in hyperspectral data
Hyperspectral imaging segmentation has been an active research area over the past few years. Despite the growing interest, some factors such as high spectrum variability are still...
Silvia Valero, Philippe Salembier, Jocelyn Chanuss...
ICDE
2002
IEEE
128views Database» more  ICDE 2002»
15 years 11 months ago
Efficiently Ordering Query Plans for Data Integration
The goal of a data integration system is to provide a uniform interface to a multitude of data sources. Given a user query formulated in this interface, the system translates it i...
AnHai Doan, Alon Y. Halevy