Sciweavers

3096 search results - page 44 / 620
» The Generalized FITC Approximation
Sort
View
ESA
2010
Springer
207views Algorithms» more  ESA 2010»
13 years 9 months ago
Budgeted Red-Blue Median and Its Generalizations
In a Content Distribution Network application, we have a set of servers and a set of clients to be connected to the servers. Often there are a few server types and a hard budget co...
MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kor...
AAAI
2012
11 years 11 months ago
Optimal Proportional Cake Cutting with Connected Pieces
We consider the classic cake cutting problem where one allocates a divisible cake to n participating agents. Among all valid divisions, fairness and efficiency (a.k.a. social wel...
Xiaohui Bei, Ning Chen, Xia Hua, Biaoshuai Tao, En...
KR
2000
Springer
14 years 7 days ago
Approximate Objects and Approximate Theories
We propose to extend the ontology of logical AI to include approximate objects, approximate predicates and approximate theories. Besides the ontology we treat the relations among ...
John McCarthy
FLAIRS
2003
13 years 10 months ago
Indeterminacy and Rough Approximation
This paper deals with the problem of merging descriptions of approximate spatial location specified at different levels of granularity. We distinguish between the roughness of an...
Thomas Bittner
COMGEO
1999
ACM
13 years 8 months ago
Point labeling with sliding labels
This paper discusses algorithms for labeling sets of points in the plane, where labels are not restricted to some finite number of positions. We show that continuously sliding lab...
Marc J. van Kreveld, Tycho Strijk, Alexander Wolff