376 search results - page 68 / 76 » Near-optimum Universal Graphs for Graphs with Bounded Degree... |
CAINE
2008
13 years 10 months ago
2008
This article is about the new universal architecture which allows electronic devices of different functionalities and manufacturers, as well as on-line services, to seamlessly int...
SODA
2008
ACM
13 years 10 months ago
2008
ACM
In this paper, we study online algorithms when the input is not chosen adversarially, but consists of draws from some given probability distribution. While this model has been stu...
SIAMCO
2010
13 years 3 months ago
2010
Tracking of reference signals (assumed bounded with essentially bounded derivative) is considered for a class of single-input, single-output, nonlinear systems, described by a func...
PODC
2011
ACM
12 years 11 months ago
2011
ACM
In this paper we study the problem of building a connected dominating set with constant degree (CCDS) in the dual graph radio network model [4,9,10]. This model includes two types...
PODS
2004
ACM
14 years 8 months ago
2004
ACM
Unions of conjunctive queries, also known as select-project-join-union queries, are the most frequently asked queries in relational database systems. These queries are definable b...