Sciweavers

15485 search results - page 70 / 3097
» Computing Optimal Subsets
Sort
View
CVPR
2012
IEEE
11 years 10 months ago
See all by looking at a few: Sparse modeling for finding representative objects
We consider the problem of finding a few representatives for a dataset, i.e., a subset of data points that efficiently describes the entire dataset. We assume that each data poi...
Ehsan Elhamifar, Guillermo Sapiro, René Vid...
CIDM
2007
IEEE
13 years 7 months ago
Detection of Unknown Computer Worms Activity Based on Computer Behavior using Data Mining
— Detecting unknown worms is a challenging task. Extant solutions, such as anti-virus tools, rely mainly on prior explicit knowledge of specific worm signatures. As a result, aft...
Robert Moskovitch, Ido Gus, Shay Pluderman, Dima S...
ATAL
2010
Springer
13 years 8 months ago
A decentralised coordination algorithm for minimising conflict and maximising coverage in sensor networks
In large wireless sensor networks, the problem of assigning radio frequencies to sensing agents such that no two connected sensors are assigned the same value (and will thus inter...
Ruben Stranders, Alex Rogers, Nicholas R. Jennings
IJCAI
2007
13 years 9 months ago
Fast Image Alignment Using Anytime Algorithms
Image alignment refers to finding the best transformation from a fixed reference image to a new image of a scene. This process is often guided by similarity measures between ima...
Rupert Brooks, Tal Arbel, Doina Precup
AIPS
2006
13 years 9 months ago
Optimal Rectangle Packing: A Meta-CSP Approach
We present a new approach to optimal rectangle packing, an NP-complete problem that can be used to model many simple scheduling tasks. Recent attempts at incorporating artificial ...
Michael D. Moffitt, Martha E. Pollack