Sciweavers

740 search results - page 111 / 148
» An approximation ratio for biclustering
Sort
View
PSIVT
2007
Springer
110views Multimedia» more  PSIVT 2007»
15 years 6 months ago
Measuring Linearity of Ordered Point Sets
It is often practical to measure how linear a certain ordered set of points is. We are interested in linearity measures which are invariant to rotation, scaling, and translation. T...
Milos Stojmenovic, Amiya Nayak
ICALP
2004
Springer
15 years 5 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
SODA
2003
ACM
157views Algorithms» more  SODA 2003»
15 years 1 months ago
Competitive queueing policies for QoS switches
We consider packet scheduling in a network providing differentiated services, where each packet is assigned a value. We study various queueing models for supporting QoS (Quality ...
Nir Andelman, Yishay Mansour, An Zhu
GLOBECOM
2010
IEEE
14 years 9 months ago
Trust Management for Encounter-Based Routing in Delay Tolerant Networks
: We propose and analyze a class of trust management protocols for encounter-based routing in delay tolerant networks (DTNs). The underlying idea is to incorporate trust evaluation...
Ing-Ray Chen, Fenye Bao, Moonjeong Chang, Jin-Hee ...
TWC
2010
14 years 6 months ago
Optimized opportunistic multicast scheduling (OMS) over wireless cellular networks
Optimized opportunistic multicast scheduling (OMS) is studied for cellular networks, where the problem of efficiently transmitting a common set of fountain-encoded data from a sin...
Tze-Ping Low, Man-On Pun, Yao-Win Peter Hong, C.-C...