Sciweavers

12536 search results - page 248 / 2508
» Cardinality Networks and Their Applications
Sort
View
FOCS
2009
IEEE
16 years 1 months ago
Symmetry and Approximability of Submodular Maximization Problems
Abstract— A number of recent results on optimization problems involving submodular functions have made use of the ”multilinear relaxation” of the problem [3], [8], [24], [14]...
Jan Vondrák
ACSC
2008
IEEE
16 years 1 months ago
Privacy preserving set intersection based on bilinear groups
We propose a more efficient privacy preserving set intersection protocol which improves the previously known result by a factor of O(N) in both the computation and communication c...
Yingpeng Sang, Hong Shen
FOCS
2007
IEEE
16 years 28 days ago
Adaptive Simulated Annealing: A Near-optimal Connection between Sampling and Counting
We present a near-optimal reduction from approximately counting the cardinality of a discrete set to approximately sampling elements of the set. An important application of our wo...
Daniel Stefankovic, Santosh Vempala, Eric Vigoda
MIR
2004
ACM
92views Multimedia» more  MIR 2004»
16 years 14 hour ago
Researchexplorer: gaining insights through exploration in multimedia scientific data
An increasing amount of heterogeneous information about scientific research is becoming available on-line. This potentially allows users to explore the information from multiple p...
Bo Gong, Rahul Singh, Ramesh Jain
WOLLIC
2010
Springer
15 years 11 months ago
Modal Logics with Counting
Abstract. We present a modal language that includes explicit operators to count the number of elements that a model might include in the extension of a formula, and we discuss how ...
Carlos Areces, Guillaume Hoffmann, Alexandre Denis