Sciweavers

518 search results - page 32 / 104
» Beating a Random Assignment
Sort
View
119
Voted
INFOCOM
2008
IEEE
15 years 8 months ago
Decentralized Rate Regulation in Random Access Channels
—We consider a time-slotted multipacket reception channel, shared by a finite number of mobile users who transmit to a common base station. Each user is allocated a fixed data ...
Ishai Menache, Nahum Shimkin
ICTAI
2006
IEEE
15 years 8 months ago
Outlier Detection Using Random Walks
The discovery of objects with exceptional behavior is an important challenge from a knowledge discovery standpoint and has attracted much attention recently. In this paper, we pre...
H. D. K. Moonesinghe, Pang-Ning Tan
127
Voted
SIGCSE
2005
ACM
146views Education» more  SIGCSE 2005»
15 years 8 months ago
Using image processing projects to teach CS1 topics
As Computer Science educators, we know that students learn more from projects that are fun and challenging, that seem “real” to them, and that allow them to be creative in des...
Richard Wicentowski, Tia Newhall
ICALP
2004
Springer
15 years 7 months ago
Online Scheduling with Bounded Migration
Consider the classical online scheduling problem where jobs that arrive one by one are assigned to identical parallel machines with the objective of minimizing the makespan. We gen...
Peter Sanders, Naveen Sivadasan, Martin Skutella
JACM
2007
79views more  JACM 2007»
15 years 2 months ago
A new look at survey propagation and its generalizations
This article provides a new conceptual perspective on survey propagation, which is an iterative algorithm recently introduced by the statistical physics community that is very effe...
Elitza N. Maneva, Elchanan Mossel, Martin J. Wainw...