Sciweavers

3946 search results - page 377 / 790
» The computational complexity of choice sets
Sort
View
ACID
2006
298views Algorithms» more  ACID 2006»
15 years 9 months ago
Congestion Games: Optimization in Competition
In a congestion game, several players simultaneously aim at allocating sets of resources, e.g., each player aims at allocating a shortest path between a source/destination pair in ...
Berthold Vöcking
ICASSP
2009
IEEE
16 years 2 months ago
Inpainting with sparse linear combinations of exemplars
We introduce a new exemplar-based inpainting algorithm that represents the region to be inpainted as a sparse linear combination of example blocks, extracted from the image being ...
Brendt Wohlberg
IJCNN
2007
IEEE
16 years 1 months ago
Search Strategies Guided by the Evidence for the Selection of Basis Functions in Regression
— This work addresses the problem of selecting a subset of basis functions for a model linear in the parameters for regression tasks. Basis functions from a set of candidates are...
Ignacio Barrio, Enrique Romero, Lluís Belan...
BSN
2006
IEEE
194views Sensor Networks» more  BSN 2006»
16 years 1 months ago
Activity Recognition and Monitoring Using Multiple Sensors on Different Body Positions
The design of an activity recognition and monitoring system based on the eWatch, multi-sensor platform worn on different body positions, is presented in this paper. The system ide...
Uwe Maurer, Asim Smailagic, Daniel P. Siewiorek, M...
ISIPTA
2005
IEEE
168views Mathematics» more  ISIPTA 2005»
16 years 1 months ago
Approximate Inference in Credal Networks by Variational Mean Field Methods
Graph-theoretical representations for sets of probability measures (credal networks) generally display high complexity, and approximate inference seems to be a natural solution fo...
Jaime Shinsuke Ide, Fabio Gagliardi Cozman