Sciweavers

2925 search results - page 452 / 585
» Information Complexity of Online Problems
Sort
View
BMCBI
2004
123views more  BMCBI 2004»
15 years 3 months ago
galaxieEST: addressing EST identity through automated phylogenetic analysis
Background: Research involving expressed sequence tags (ESTs) is intricately coupled to the existence of large, well-annotated sequence repositories. Comparatively complete and sa...
R. Henrik Nilsson, Balaji Rajashekar, Karl-Henrik ...
ICDE
2011
IEEE
237views Database» more  ICDE 2011»
14 years 7 months ago
Creating probabilistic databases from imprecise time-series data
— Although efficient processing of probabilistic databases is a well-established field, a wide range of applications are still unable to benefit from these techniques due to t...
Saket Sathe, Hoyoung Jeung, Karl Aberer
131
Voted
KDD
2012
ACM
179views Data Mining» more  KDD 2012»
13 years 6 months ago
Transparent user models for personalization
Personalization is a ubiquitous phenomenon in our daily online experience. While such technology is critical for helping us combat the overload of information we face, in many cas...
Khalid El-Arini, Ulrich Paquet, Ralf Herbrich, Jur...
ICCV
1999
IEEE
16 years 6 months ago
A Simple and Efficient Rectification Method for General Motion
In this paper a new rectification method is proposed. The method is both simple and efficient and can deal with all possible camera motions. A minimal image size without any pixel...
Marc Pollefeys, Reinhard Koch, Luc J. Van Gool
ICDE
1999
IEEE
89views Database» more  ICDE 1999»
16 years 5 months ago
Relative Prefix Sums: An Efficient Approach for Querying Dynamic OLAP Data Cubes
Range sum queries on data cubes are a powerful tool for analysis. A range sum query applies an aggregation operation (e.g., SUM) over all selected cells in a data cube, where the ...
Steven Geffner, Divyakant Agrawal, Amr El Abbadi, ...