Sciweavers

3946 search results - page 542 / 790
» The computational complexity of choice sets
Sort
View
VC
2010
143views more  VC 2010»
15 years 1 months ago
A PDE method for patchwise approximation of large polygon meshes
Abstract Three-dimensional (3D) representations of complex geometric shapes, especially when they are reconstructed from magnetic resonance imaging (MRI) and computed tomography (C...
Yun Sheng, Alexei Sourin, Gabriela González...
IACR
2011
147views more  IACR 2011»
14 years 6 months ago
Adaptive Security of Concurrent Non-Malleable Zero-Knowledge
A zero-knowledge protocol allows a prover to convince a verifier of the correctness of a statement without disclosing any other information to the verifier. It is a basic tool a...
Zhenfu Cao, Zongyang Zhang, Yunlei Zhao
INFOCOM
2012
IEEE
13 years 9 months ago
Scalable routing in 3D high genus sensor networks using graph embedding
—We study scalable routing for a sensor network deployed in complicated 3D settings such as underground tunnels in gas system or water system. The nodes are in general 3D space b...
Xiaokang Yu, Xiaotian Yin, Wei Han, Jie Gao, Xianf...
FSTTCS
2009
Springer
16 years 1 months ago
Subexponential Algorithms for Partial Cover Problems
Partial Cover problems are optimization versions of fundamental and well studied problems like Vertex Cover and Dominating Set. Here one is interested in covering (or dominating) ...
Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman...
221
Voted
KES
2007
Springer
16 years 25 days ago
Inductive Concept Retrieval and Query Answering with Semantic Knowledge Bases Through Kernel Methods
This work deals with the application of kernel methods to structured relational settings such as semantic knowledge bases expressed in Description Logics. Our method integrates a n...
Nicola Fanizzi, Claudia d'Amato