Sciweavers

1091 search results - page 115 / 219
» Approximation Algorithms for Data Placement Problems
Sort
View
JMLR
2010
367views more  JMLR 2010»
13 years 2 months ago
Locally Linear Denoising on Image Manifolds
We study the problem of image denoising where images are assumed to be samples from low dimensional (sub)manifolds. We propose the algorithm of locally linear denoising. The algor...
Dian Gong, Fei Sha, Gérard G. Medioni
ATAL
2006
Springer
13 years 11 months ago
Predicting people's bidding behavior in negotiation
This paper presents a statistical learning approach to predicting people's bidding behavior in negotiation. Our study consists of multiple 2-player negotiation scenarios wher...
Ya'akov Gal, Avi Pfeffer
SIGMOD
2011
ACM
276views Database» more  SIGMOD 2011»
12 years 10 months ago
Schedule optimization for data processing flows on the cloud
Scheduling data processing workflows (dataflows) on the cloud is a very complex and challenging task. It is essentially an optimization problem, very similar to query optimizati...
Herald Kllapi, Eva Sitaridi, Manolis M. Tsangaris,...
KDD
2006
ACM
129views Data Mining» more  KDD 2006»
14 years 8 months ago
Suppressing model overfitting in mining concept-drifting data streams
Mining data streams of changing class distributions is important for real-time business decision support. The stream classifier must evolve to reflect the current class distributi...
Haixun Wang, Jian Yin, Jian Pei, Philip S. Yu, Jef...
CIKM
2009
Springer
14 years 2 months ago
Evaluating top-k queries over incomplete data streams
We study the problem of continuous monitoring of top-k queries over multiple non-synchronized streams. Assuming a sliding window model, this general problem has been a well addres...
Parisa Haghani, Sebastian Michel, Karl Aberer