Sciweavers

450 search results - page 79 / 90
» Adaptive Algorithms for Online Decision Problems
Sort
View
ICPR
2008
IEEE
14 years 2 months ago
Incremental clustering via nonnegative matrix factorization
Nonnegative matrix factorization (NMF) has been shown to be an efficient clustering tool. However, NMF`s batch nature necessitates recomputation of whole basis set for new samples...
Serhat Selcuk Bucak, Bilge Günsel
ICMCS
2007
IEEE
120views Multimedia» more  ICMCS 2007»
14 years 2 months ago
Optimal Scheduling of Media Packets with Multiple Distortion Measures
Due to the increase in diversity of wireless devices, streaming media systems must be capable of serving multiple types of users. Scalable coding allows for adaptations without re...
Carri W. Chan, Nicholas Bambos, Susie Wee, John G....
AAMAS
2007
Springer
13 years 8 months ago
An experts approach to strategy selection in multiagent meeting scheduling
Abstract. In the multiagent meeting scheduling problem, agents negotiate with each other on behalf of their users to schedule meetings. While a number of negotiation approaches hav...
Elisabeth Crawford, Manuela M. Veloso
ICCV
2009
IEEE
13 years 5 months ago
Realtime background subtraction from dynamic scenes
This paper examines the problem of moving object detection. More precisely, it addresses the difficult scenarios where background scene textures in the video might change over tim...
Li Cheng, Minglun Gong
GLOBECOM
2007
IEEE
14 years 2 months ago
Reduced Complexity Sphere Decoding for Square QAM via a New Lattice Representation
— Sphere decoding (SD) is a low complexity maximum likelihood (ML) detection algorithm, which has been adapted for different linear channels in digital communications. The comple...
Luay Azzam, Ender Ayanoglu