Sciweavers

664 search results - page 56 / 133
» Some results for a class of generalized polynomials
Sort
View
DLOG
2007
15 years 3 days ago
Partitioning ABoxes Based on Converting DL to Plain Datalog
Abstract. To make ABox reasoning scalable for large ABoxes in description logic (DL) knowledge bases, we develop a method for partitioning the ABox so that specific kinds of reaso...
Jianfeng Du, Yi-Dong Shen
SODA
2010
ACM
397views Algorithms» more  SODA 2010»
15 years 7 months ago
Improved Approximation Algorithms for the Minimum Latency Problem via Prize-Collecting Strolls
The minimum latency problem (MLP) is a well-studied variant of the traveling salesman problem (TSP). In the MLP, the server's goal is to minimize the average latency that the...
Aaron Archer, Anna Blasiak
ALT
2011
Springer
13 years 9 months ago
Semantic Communication for Simple Goals Is Equivalent to On-line Learning
Abstract. Previous works [11, 6] introduced a model of semantic communication between a “user” and a “server,” in which the user attempts to achieve a given goal for commun...
Brendan Juba, Santosh Vempala
VALUETOOLS
2006
ACM
111views Hardware» more  VALUETOOLS 2006»
15 years 3 months ago
Stability of multi-class queueing systems with state-dependent service rates
We examine the stability of multi-class queueing systems with the special feature that the service rates of the various classes depend on the number of users present of each of th...
Matthieu Jonckheere, Sem C. Borst
JMIV
2008
97views more  JMIV 2008»
14 years 9 months ago
Fusion Graphs: Merging Properties and Watersheds
Region merging methods consist of improving an initial segmentation by merging some pairs of neighboring regions. In this paper, we consider a segmentation as a set of connected r...
Jean Cousty, Gilles Bertrand, Michel Couprie, Laur...