Sciweavers

166 search results - page 4 / 34
» Analyzing Problem Frames together with Solution Patterns
Sort
View
GLOBECOM
2010
IEEE
13 years 5 months ago
A Dynamic Framed ALOHA Scheme for Batch Resolution in Practical CSMA-Based Wireless Networks
Abstract--The batch resolution problem consists in arbitrating the channel access of a group of nodes in a wireless network in order to collect a single packet from each node in th...
Andrea Zanella
CSCLP
2004
Springer
14 years 26 days ago
Super Solutions for Combinatorial Auctions
Super solutions provide a framework for finding robust solutions to Constraint Satisfaction Problems [5, 3]. We present a novel application of super solutions to combinatorial auc...
Alan Holland, Barry O'Sullivan
CVPR
2003
IEEE
14 years 9 months ago
Subset Selection for Efficient SVM Tracking
We update the SVM score of an object through a video sequence with a small and variable subset of support vectors. In the first frame we use all the support vectors to compute the...
Shai Avidan
ICASSP
2009
IEEE
14 years 2 months ago
Analyzing Least Squares and Kalman Filtered Compressed Sensing
In recent work, we studied the problem of causally reconstructing time sequences of spatially sparse signals, with unknown and slow time-varying sparsity patterns, from a limited ...
Namrata Vaswani
TIME
1998
IEEE
13 years 11 months ago
Tackling the Qualification Problem using Fluent Dependency Constraints: Preliminary Report
The use of causal rules or fluent dependency constraints has proven to provide a versatile means of dealing with the ramification problem. In this paper we show how fluent depende...
Patrick Doherty, Jonas Kvarnström