Sciweavers

618 search results - page 116 / 124
» Aggregated Subset Mining
Sort
View
ECCV
2010
Springer
14 years 1 months ago
Robust Multi-View Boosting with Priors
Many learning tasks for computer vision problems can be described by multiple views or multiple features. These views can be exploited in order to learn from unlabeled data, a.k.a....
SIGMOD
1999
ACM
108views Database» more  SIGMOD 1999»
14 years 22 days ago
DynaMat: A Dynamic View Management System for Data Warehouses
Pre-computation and materialization of views with aggregate functions is a common technique in Data Warehouses. Due to the complex structure of the warehouse and the different pro...
Yannis Kotidis, Nick Roussopoulos
VLDB
2000
ACM
155views Database» more  VLDB 2000»
14 years 8 hour ago
ICICLES: Self-Tuning Samples for Approximate Query Answering
Approximate query answering systems provide very fast alternatives to OLAP systems when applications are tolerant to small errors in query answers. Current sampling-based approach...
Venkatesh Ganti, Mong-Li Lee, Raghu Ramakrishnan
COR
2010
123views more  COR 2010»
13 years 8 months ago
Decomposition, reformulation, and diving in university course timetabling
In many real-life optimisation problems, there are multiple interacting components in a solution. For example, different components might specify assignments to different kinds of...
Edmund K. Burke, Jakub Marecek, Andrew J. Parkes, ...
CN
2006
91views more  CN 2006»
13 years 8 months ago
Reputation-based policies that provide the right incentives in peer-to-peer environments
Peer-to-peer are popular environments for exchanging services. A reputation mechanism is a proper means of discovering low-performing peers that fail to provide their services. In...
Thanasis G. Papaioannou, George D. Stamoulis