1019 search results - page 122 / 204 » Uniform Functors on Sets |
TPDS
2010
13 years 8 months ago
2010
This paper studies the problem of realizing a common software clock among a large set of nodes without an external time reference (i.e., internal clock synchronization), any centr...
BROADNETS
2007
IEEE
14 years 4 months ago
2007
IEEE
—Epidemic protocols assume that information of a random set of nodes is provided at each protocol round. By definition, the random set needs to be chosen uniformly and randomly ...
DAM
2010
13 years 10 months ago
2010
Abstract. A set of phylogenetic trees with overlapping leaf sets is consistent if it can be merged without conflicts into a supertree. In this paper, we study the polynomial-time a...
WWW
2009
ACM
14 years 10 months ago
2009
ACM
Motivated by the emergence of auction-based marketplaces for display ads such as the Right Media Exchange, we study the design of a bidding agent that implements a display adverti...
PODS
2007
ACM
14 years 10 months ago
2007
ACM
We consider the problem of constructing decision trees for entity identification from a given relational table. The input is a table containing information about a set of entities...