Sciweavers

ICPR
2010
IEEE
13 years 7 months ago
The New Blockwise Algorithm for Large-Scale Images Robust Watermarking
A new algorithm for digital watermarking of largescale digital images is proposed in the article. The proposed algorithm provides watermark robustness to a wide range of host imag...
Nikolay Ivanovich Glumov, Vitaly Anatolyevich Mite...
ICML
2010
IEEE
13 years 7 months ago
Learning optimally diverse rankings over large document collections
Most learning to rank research has assumed that the utility of different documents is independent, which results in learned ranking functions that return redundant results. The fe...
Aleksandrs Slivkins, Filip Radlinski, Sreenivas Go...
ICML
2010
IEEE
13 years 7 months ago
Implicit Online Learning
Online learning algorithms have recently risen to prominence due to their strong theoretical guarantees and an increasing number of practical applications for large-scale data ana...
Brian Kulis, Peter L. Bartlett
ICIP
2010
IEEE
13 years 7 months ago
Randomized motion estimation
Motion estimation is known to be a non-convex optimization problem. This non-convexity comes from several ambiguities in motion estimation such as the aperture problem, or fast mo...
Sylvain Boltz, Frank Nielsen
ICIP
2010
IEEE
13 years 7 months ago
Rotation robust detection of copy-move forgery
Copy-move tampering is a common type of image synthesizing, where a part of an image is copied and pasted to another place to add or remove an object. In this paper, an efficient ...
Weihai Li, Nenghai Yu
ICDM
2010
IEEE
115views Data Mining» more  ICDM 2010»
13 years 7 months ago
Polishing the Right Apple: Anytime Classification Also Benefits Data Streams with Constant Arrival Times
Classification of items taken from data streams requires algorithms that operate in time sensitive and computationally constrained environments. Often, the available time for class...
Jin Shieh, Eamonn J. Keogh
ICDM
2010
IEEE
127views Data Mining» more  ICDM 2010»
13 years 7 months ago
Learning Markov Network Structure with Decision Trees
Traditional Markov network structure learning algorithms perform a search for globally useful features. However, these algorithms are often slow and prone to finding local optima d...
Daniel Lowd, Jesse Davis
ICDM
2010
IEEE
135views Data Mining» more  ICDM 2010»
13 years 7 months ago
Learning a Bi-Stochastic Data Similarity Matrix
An idealized clustering algorithm seeks to learn a cluster-adjacency matrix such that, if two data points belong to the same cluster, the corresponding entry would be 1; otherwise ...
Fei Wang, Ping Li, Arnd Christian König
ICDM
2010
IEEE
142views Data Mining» more  ICDM 2010»
13 years 7 months ago
Causal Discovery from Streaming Features
In this paper, we study a new research problem of causal discovery from streaming features. A unique characteristic of streaming features is that not all features can be available ...
Kui Yu, Xindong Wu, Hao Wang, Wei Ding
IC
2010
13 years 7 months ago
Distributed Algorithms for the Placement of Network Services
Network services play an important role in the Internet today. They serve as data caches for websites, servers for multiplayer games and relay nodes for Voice over IP (VoIP) conver...
Todd Sproull, Roger Chamberlain