2814 search results - page 339 / 563 » Competitive Analysis of Distributed Algorithms |
FOCS
2008
IEEE
13 years 12 months ago
2008
IEEE
Given a universe U of n elements and a weighted collection S of m subsets of U, the universal set cover problem is to a-priori map each element u ∈ U to a set S(u) ∈ S contain...
PODS
2006
ACM
14 years 11 months ago
2006
ACM
In this paper, we give a simple scheme for identifying approximate frequent items over a sliding window of size n. Our scheme is deterministic and does not make any assumption on ...
IWDW
2009
Springer
14 years 5 months ago
2009
Springer
In this paper, we propose a blind watermarking algorithm for 3D meshes. The proposed algorithm embeds spectral domain constraints in segmented patches. After aligning the 3D object...
ICPADS
2007
IEEE
14 years 5 months ago
2007
IEEE
Given an undirected graph with weights associated with its edges, the Steiner tree problem consists of finding a minimum weight subtree spanning a given subset of (terminal) nodes...
SIGECOM
2005
ACM
14 years 4 months ago
2005
ACM
We present a new approach to representing coalitional games based on rules that describe the marginal contributions of the agents. This representation scheme captures characterist...