Sciweavers

3991 search results - page 281 / 799
» Bounding homogeneous models
Sort
View
ICMCS
2009
IEEE
222views Multimedia» more  ICMCS 2009»
15 years 4 months ago
3D Gaussian descriptor for 3D shape retrieval
This paper presents a new approach to 3D shape comparison and retrieval based on the computation of Gaussian transforms of the surface model on a set of points regularly distribut...
Mohamed Chaouch, Anne Verroust-Blondet
TSP
2010
15 years 1 months ago
Randomized and distributed self-configuration of wireless networks: two-layer Markov random fields and near-optimality
Abstract--This work studies the near-optimality versus the complexity of distributed configuration management for wireless networks. We first develop a global probabilistic graphic...
Sung-eok Jeon, Chuanyi Ji
STOC
2006
ACM
92views Algorithms» more  STOC 2006»
16 years 7 months ago
On the importance of idempotence
Range searching is among the most fundamental problems in computational geometry. An n-element point set in Rd is given along with an assignment of weights to these points from so...
Sunil Arya, Theocharis Malamatos, David M. Mount
CSL
2009
Springer
15 years 10 months ago
Tree-Width for First Order Formulae
We introduce tree-width for first order formulae , fotw(). We show that computing fotw is fixed-parameter tractable with parameter fotw. Moreover, we show that on classes of formul...
Isolde Adler, Mark Weyer
ECCC
2008
168views more  ECCC 2008»
15 years 6 months ago
Algebrization: A New Barrier in Complexity Theory
Any proof of P = NP will have to overcome two barriers: relativization and natural proofs. Yet over the last decade, we have seen circuit lower bounds (for example, that PP does n...
Scott Aaronson, Avi Wigderson