Sciweavers

113 search results - page 19 / 23
» On the expected value of the minimum assignment
Sort
View
JPDC
2006
148views more  JPDC 2006»
14 years 9 months ago
Efficient algorithm for placing a given number of base stations to cover a convex region
In the context of mobile communication, an efficient algorithm for the base-station placement problem is developed in this paper. The objective is to place a given number of base-...
Gautam K. Das, Sandip Das, Subhas C. Nandy, Bhaban...
78
Voted
CVIU
2004
134views more  CVIU 2004»
14 years 9 months ago
The "dead reckoning" signed distance transform
Consider a binary image containing one or more objects. A signed distance transform assigns to each pixel (voxel, etc.), both inside and outside of any objects, the minimum distan...
George J. Grevera
UIST
2010
ACM
14 years 7 months ago
Mixture model based label association techniques for web accessibility
An important aspect of making the Web accessible to blind users is ensuring that all important web page elements such as links, clickable buttons, and form fields have explicitly ...
Muhammad Asiful Islam, Yevgen Borodin, I. V. Ramak...
STOC
2009
ACM
96views Algorithms» more  STOC 2009»
15 years 10 months ago
MaxMin allocation via degree lower-bounded arborescences
We consider the problem of MaxMin allocation of indivisible goods. There are m items to be distributed among n players. Each player i has a nonnegative valuation pij for an item j...
MohammadHossein Bateni, Moses Charikar, Venkatesan...
ICDE
2007
IEEE
133views Database» more  ICDE 2007»
15 years 11 months ago
Preference-Aware Query and Update Scheduling in Web-databases
Typical web-database systems receive read-only queries, that generate dynamic web pages as a response, and writeonly updates, that keep information up-to-date. Users expect short ...
Huiming Qu, Alexandros Labrinidis