Sciweavers

1326 search results - page 218 / 266
» Approximate Tree Kernels
Sort
View
NIPS
1997
15 years 4 months ago
Structure Driven Image Database Retrieval
A new algorithm is presented which approximates the perceived visual similarity between images. The images are initially transformed into a feature space which captures visual str...
Jeremy S. De Bonet, Paul A. Viola
CORR
2010
Springer
103views Education» more  CORR 2010»
15 years 3 months ago
Probabilistic regular graphs
Deterministic graph grammars generate regular graphs, that form a structural extension of configuration graphs of pushdown systems. In this paper, we study a probabilistic extensio...
Nathalie Bertrand, Christophe Morvan
SLOGICA
2008
126views more  SLOGICA 2008»
15 years 3 months ago
On the Proof Theory of the Modal mu-Calculus
We study the proof-theoretic relationship between two deductive systems for the modal mu-calculus. First we recall an infinitary system which contains an omega rule allowing to de...
Thomas Studer
CAGD
2005
130views more  CAGD 2005»
15 years 3 months ago
Truly selective polygonal mesh hierarchies with error control
In this work a new multi-resolution model is proposed for polygonal meshes. It is based on the dual edge collapse, which performs face clustering instead of vertex clustering. The...
Stefan Gumhold
JDA
2007
97views more  JDA 2007»
15 years 3 months ago
Local solutions for global problems in wireless networks
In this paper, we review a recently developed class of algorithms that solve global problems in unit distance wireless networks by means of local algorithms. A local algorithm is ...
Jorge Urrutia