2200 search results - page 389 / 440 » Bloch's Constant is Computable |
COMPGEOM
2006
ACM
15 years 3 months ago
2006
ACM
In a Batched Colored Intersection Searching Problem (CI), one is given a set of n geometric objects (of a certain class). Each object is colored by one of c colors, and the goal i...
SPAA
2006
ACM
15 years 3 months ago
2006
ACM
Consider a network in which a collection of source nodes maintain and periodically update data objects for a collection of sink nodes, each of which periodically accesses the data...
SPAA
2006
ACM
15 years 3 months ago
2006
ACM
We consider a model of game-theoretic network design initially studied by Anshelevich et al. [2], where selfish players select paths in a network to minimize their cost, which is...
FOCS
2005
IEEE
15 years 3 months ago
2005
IEEE
We consider the problem of learning mixtures of product distributions over discrete domains in the distribution learning framework introduced by Kearns et al. [18]. We give a poly...
109
click to vote
ISPAN
2005
IEEE
15 years 3 months ago
2005
IEEE
We design a self-stabilizing cluster routing algorithm based on the link-cluster architecture of wireless ad hoc networks. The network is divided into clusters. Each cluster has a...