Sciweavers

3894 search results - page 406 / 779
» Approximation Algorithms for Biclustering Problems
Sort
View
KDD
2012
ACM
187views Data Mining» more  KDD 2012»
13 years 7 months ago
Online learning to diversify from implicit feedback
In order to minimize redundancy and optimize coverage of multiple user interests, search engines and recommender systems aim to diversify their set of results. To date, these dive...
Karthik Raman, Pannaga Shivaswamy, Thorsten Joachi...
ICDE
2009
IEEE
139views Database» more  ICDE 2009»
16 years 6 months ago
Minimizing Communication Cost in Distributed Multi-query Processing
Increasing prevalence of large-scale distributed monitoring and computing environments such as sensor networks, scientific federations, Grids etc., has led to a renewed interest in...
Jian Li, Amol Deshpande, Samir Khuller
152
Voted
CDC
2009
IEEE
128views Control Systems» more  CDC 2009»
15 years 8 months ago
The entropy penalized minimum energy estimator
This paper addresses the state estimation problem of nonlinear systems. We formulate the problem using a minimum energy estimator (MEE) approach and propose an entropy penalized sc...
Sergio Daniel Pequito, A. Pedro Aguiar, Diogo A. G...
DCOSS
2008
Springer
15 years 6 months ago
Improving the Data Delivery Latency in Sensor Networks with Controlled Mobility
Unlike traditional multihop forwarding among homogeneous static sensor nodes, use of mobile devices for data collection in wireless sensor networks has recently been gathering more...
Ryo Sugihara, Rajesh K. Gupta
WEA
2007
Springer
107views Algorithms» more  WEA 2007»
15 years 11 months ago
Trunk Packing Revisited
For trunk packing problems only few approximation schemes are known, mostly designed for the European standard DIN 70020 [6] with equally sized boxes [8, 9, 11, 12]. In this paper ...
Ernst Althaus, Tobias Baumann, Elmar Schömer,...