Sciweavers

5210 search results - page 315 / 1042
» Exact geometric computation
Sort
View
RTA
2000
Springer
15 years 10 months ago
Linear Higher-Order Matching Is NP-Complete
We consider the problem of higher-order matching restricted et of linear -terms (i.e., -terms where each abstraction x. M is such that there is exactly one free occurrence of x in ...
Philippe de Groote
BIRTHDAY
2010
Springer
15 years 10 months ago
From Nondeterministic Suffix Automaton to Lazy Suffix Tree
Given two strings, a pattern P of length m and a text T of length n over some alphabet of size , we consider the exact string matching problem, i.e. we want to report all occurren...
Kimmo Fredriksson
ATAL
2008
Springer
15 years 8 months ago
Selecting strategies using empirical game models: an experimental analysis of meta-strategies
In many complex multi-agent domains it is impractical to compute exact analytic solutions. An alternate means of analysis applies computational tools to derive and analyze empiric...
Christopher Kiekintveld, Michael P. Wellman
DLT
2010
15 years 8 months ago
On a Powerful Class of Non-universal P Systems with Active Membranes
Abstract. We prove that uniform and semi-uniform families of P systems with active membranes using only communication and nonelementary division rules are not computationally unive...
Antonio E. Porreca, Alberto Leporati, Claudio Zand...
ECCV
2010
Springer
15 years 7 months ago
Adaptive Metric Registration of 3D Models to Non-rigid Image Trajectories
Abstract. This paper addresses the problem of registering a 3D model, represented as a cloud of points lying over a surface, to a set of 2D deforming image trajectories in the imag...
Alessio Del Bue