Sciweavers

3176 search results - page 411 / 636
» A Multi-Resolution Relational Data Model
Sort
View
107
Voted
ER
2007
Springer
137views Database» more  ER 2007»
15 years 9 months ago
Prioritized Preferences and Choice Constraints
It is increasingly recognised that user preferences should be addressed in many advanced database applications, such as adaptive searching in databases. However, the fundamental is...
Wilfred Ng
106
Voted
CVPR
2008
IEEE
16 years 4 months ago
Object categorization using co-occurrence, location and appearance
In this work we introduce a novel approach to object categorization that incorporates two types of context ? cooccurrence and relative location ? with local appearancebased featur...
Carolina Galleguillos, Andrew Rabinovich, Serge Be...
203
Voted
ICDE
1999
IEEE
106views Database» more  ICDE 1999»
16 years 4 months ago
Processing Operations with Restrictions in RDBMS without External Sorting: The Tetris Algorithm
Most operations of the relational algebra or SQL require a sorted stream of tuples for efficient processing. Therefore, processing complex relational queries relies on efficient a...
Volker Markl, Martin Zirkel, Rudolf Bayer
117
Voted
ICML
2009
IEEE
16 years 3 months ago
Boosting with structural sparsity
Despite popular belief, boosting algorithms and related coordinate descent methods are prone to overfitting. We derive modifications to AdaBoost and related gradient-based coordin...
John Duchi, Yoram Singer
PODS
2006
ACM
104views Database» more  PODS 2006»
16 years 2 months ago
Tractable database design through bounded treewidth
Given that most elementary problems in database design are NP-hard, the currently used database design algorithms produce suboptimal results. For example, the current 3NF decompos...
Georg Gottlob, Reinhard Pichler, Fang Wei