Sciweavers

12257 search results - page 2242 / 2452
» Analysis of Algorithms
Sort
View
181
Voted
JMLR
2012
13 years 6 months ago
Beyond Logarithmic Bounds in Online Learning
We prove logarithmic regret bounds that depend on the loss L∗ T of the competitor rather than on the number T of time steps. In the general online convex optimization setting, o...
Francesco Orabona, Nicolò Cesa-Bianchi, Cla...
162
Voted
ICDE
2012
IEEE
246views Database» more  ICDE 2012»
13 years 6 months ago
HiCS: High Contrast Subspaces for Density-Based Outlier Ranking
—Outlier mining is a major task in data analysis. Outliers are objects that highly deviate from regular objects in their local neighborhood. Density-based outlier ranking methods...
Fabian Keller, Emmanuel Müller, Klemens B&oum...
162
Voted
KDD
2012
ACM
178views Data Mining» more  KDD 2012»
13 years 6 months ago
Mining event periodicity from incomplete observations
Advanced technology in GPS and sensors enables us to track physical events, such as human movements and facility usage. Periodicity analysis from the recorded data is an important...
Zhenhui Li, Jingjing Wang, Jiawei Han
136
Voted
CVPR
2012
IEEE
13 years 6 months ago
Detecting activities of daily living in first-person camera views
We present a novel dataset and novel algorithms for the problem of detecting activities of daily living (ADL) in firstperson camera views. We have collected a dataset of 1 millio...
Hamed Pirsiavash, Deva Ramanan
361
Voted
DAC
2012
ACM
13 years 6 months ago
On software design for stochastic processors
Much recent research [8, 6, 7] suggests significant power and energy benefits of relaxing correctness constraints in future processors. Such processors with relaxed constraints ...
Joseph Sloan, John Sartori, Rakesh Kumar
« Prev « First page 2242 / 2452 Last » Next »