Sciweavers

213 search results - page 34 / 43
» The randomized complexity of initial value problems
Sort
View
ACL
1997
13 years 9 months ago
Co-evolution of Language and of the Language Acquisition Device
A new account of parameter setting during grammatical acquisition is presented in terms of Generalized Categorial Grammar embedded in a default inheritance hierarchy, providing a ...
Ted Briscoe
CRYPTO
2007
Springer
133views Cryptology» more  CRYPTO 2007»
14 years 1 months ago
On Secure Multi-party Computation in Black-Box Groups
Abstract. We study the natural problem of secure n-party computation (in the passive, computationally unbounded attack model) of the n-product function fG(x1, . . . , xn) = x1 · x...
Yvo Desmedt, Josef Pieprzyk, Ron Steinfeld, Huaxio...
CVPR
2012
IEEE
11 years 10 months ago
A tiered move-making algorithm for general pairwise MRFs
A large number of problems in computer vision can be modeled as energy minimization problems in a markov random field (MRF) framework. Many methods have been developed over the y...
Vibhav Vineet, Jonathan Warrell, Philip H. S. Torr
CADE
2008
Springer
14 years 8 months ago
Automated Induction with Constrained Tree Automata
We propose a procedure for automated implicit inductive theorem proving for equational specifications made of rewrite rules with conditions and constraints. The constraints are int...
Adel Bouhoula, Florent Jacquemard
ICRA
2009
IEEE
259views Robotics» more  ICRA 2009»
14 years 2 months ago
Fast Point Feature Histograms (FPFH) for 3D registration
— In our recent work [1], [2], we proposed Point Feature Histograms (PFH) as robust multi-dimensional features which describe the local geometry around a point p for 3D point clo...
Radu Bogdan Rusu, Nico Blodow, Michael Beetz