16430 search results - page 312 / 3286 » On Computable Tree Functions |
146
click to vote
SIAMDM
2010
14 years 11 months ago
2010
In this paper we consider the problem of computing the expected hitting time to a vertex for random walks on graphs. We give a method for computing an upper bound on the expected ...
140
click to vote
ACL
2012
13 years 7 months ago
2012
We investigate the potential of Tree Substitution Grammars as a source of features for native language detection, the task of inferring an author’s native language from text in ...
136
click to vote
CIE
2005
Springer
15 years 10 months ago
2005
Springer
We promote the concept of object directed computability in computational geometry in order to faithfully generalise the wellestablished theory of computability for real numbers and...
144
Voted
SIBGRAPI
1999
IEEE
15 years 9 months ago
1999
IEEE
This paper describes a real-time shadow generation algorithm for polygonal environments illuminated by movable point light sources. The main goal is to quickly reduce the number o...
159
Voted
ICCV
2011
IEEE
14 years 4 months ago
2011
IEEE
In this paper we address the problem of image retrieval from millions of database images. We improve the vocabulary tree based approach by introducing contextual weighting of loca...