Sciweavers

330 search results - page 41 / 66
» Approximation Algorithms for the Directed k-Tour and k-Strol...
Sort
View
HIPC
2007
Springer
14 years 18 days ago
Accomplishing Approximate FCFS Fairness Without Queues
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
K. Subramani, Kamesh Madduri
SIGECOM
2010
ACM
173views ECommerce» more  SIGECOM 2010»
13 years 9 months ago
Approximating pure nash equilibrium in cut, party affiliation, and satisfiability games
Cut games and party affiliation games are well-known classes of potential games. Schaffer and Yannakakis showed that computing pure Nash equilibrium in these games is PLScomplete....
Anand Bhalgat, Tanmoy Chakraborty, Sanjeev Khanna
ICCV
2005
IEEE
14 years 2 months ago
An Integrated Framework for Image Segmentation and Perceptual Grouping
This paper presents an efficient algorithm for image segmentation and a framework for perceptual grouping. It makes an attempt to provide one way of combining bottomup and top-do...
Zhuowen Tu
VLSI
2010
Springer
13 years 7 months ago
Fine-grained post placement voltage assignment considering level shifter overhead
—Multi-Vdd techniques enable application of lower supply voltage levels on cells with timing slacks. New voltage assignment, placement and voltage island partitioning methods are...
Zohreh Karimi, Majid Sarrafzadeh
TIP
1998
114views more  TIP 1998»
13 years 8 months ago
An optimal polygonal boundary encoding scheme in the rate distortion sense
—In this paper, we present fast and efficient methods for the lossy encoding of object boundaries that are given as eight-connect chain codes. We approximate the boundary by a p...
Guido M. Schuster, Aggelos K. Katsaggelos