Sciweavers

187 search results - page 31 / 38
» Structural Results For Planar Sets With Many Similar Subsets
Sort
View
CRYPTO
2012
Springer
268views Cryptology» more  CRYPTO 2012»
12 years 12 months ago
Secret Sharing Schemes for Very Dense Graphs
A secret-sharing scheme realizes a graph if every two vertices connected by an edge can reconstruct the secret while every independent set in the graph does not get any informatio...
Amos Beimel, Oriol Farràs, Yuval Mintz
CP
2009
Springer
15 years 10 months ago
The Complexity of Valued Constraint Models
The Valued Constraint Satisfaction Problem (VCSP) is a general framework encompassing many optimisation problems. We discuss precisely what it means for a problem to be modelled in...
Peter G. Jeavons, Stanislav Zivný
TOG
2002
141views more  TOG 2002»
14 years 9 months ago
Geometry images
Surface geometry is often modeled with irregular triangle meshes. The process of remeshing refers to approximating such geometry using a mesh with (semi)-regular connectivity, whi...
Xianfeng Gu, Steven J. Gortler, Hugues Hoppe
ICPR
2010
IEEE
14 years 8 months ago
Unsupervised Learning from Linked Documents
Documents in many corpora, such as digital libraries and webpages, contain both content and link information. In a traditional topic model which plays an important role in the uns...
Zhen Guo, Shenghuo Zhu, Yun Chi, Zhongfei Zhang, Y...
64
Voted
SAGT
2009
Springer
140views Game Theory» more  SAGT 2009»
15 years 4 months ago
Price of Stability in Survivable Network Design
We study the survivable version of the game theoretic network formation model known as the Connection Game, originally introduced in [5]. In this model, players attempt to connect ...
Elliot Anshelevich, Bugra Caskurlu