Sciweavers

7129 search results - page 755 / 1426
» Approximation Algorithms for Treewidth
Sort
View
ICCV
2007
IEEE
16 years 8 months ago
Mode-seeking by Medoidshifts
We present a nonparametric mode-seeking algorithm, called medoidshift, based on approximating the local gradient using a weighted estimate of medoids. Like meanshift, medoidshift ...
Yaser Sheikh, Erum A. Khan, Takeo Kanade
EDBT
2008
ACM
135views Database» more  EDBT 2008»
16 years 7 months ago
Minimizing latency and memory in DSMS: a unified approach to quasi-optimal scheduling
Data Stream Management Systems (DSMSs) must support optimized execution scheduling of multiple continuous queries on massive, and frequently bursty, data streams. Previous approac...
Yijian Bai, Carlo Zaniolo
ACCV
2007
Springer
16 years 1 months ago
Task Scheduling in Large Camera Networks
Camera networks are increasingly being deployed for security. In most of these camera networks, video sequences are captured, transmitted and archived continuously from all cameras...
Ser-Nam Lim, Larry S. Davis, Anurag Mittal
ICCV
2005
IEEE
16 years 15 days ago
KALMANSAC: Robust Filtering by Consensus
We propose an algorithm to perform causal inference of the state of a dynamical model when the measurements are corrupted by outliers. While the optimal (maximumlikelihood) soluti...
Andrea Vedaldi, Hailin Jin, Paolo Favaro, Stefano ...
ESORICS
2005
Springer
16 years 12 days ago
Privacy Preserving Clustering
The freedom and transparency of information flow on the Internet has heightened concerns of privacy. Given a set of data items, clustering algorithms group similar items together...
Somesh Jha, Louis Kruger, Patrick McDaniel