2434 search results - page 211 / 487 » Algorithmic Randomness of Closed Sets |
138
click to vote
AGENTS
1998
Springer
15 years 8 months ago
1998
Springer
We propose an agent for exploring and categorizing documents on the World Wide Web based on a user pro le. The heart of the agent is an automatic categorization of a set of docume...
144
click to vote
IJAC
2008
15 years 4 months ago
2008
Abstract. A regular set of words is (k-)locally testable if membership of a word in the set is determined by the nature of its subwords of some bounded length k. In this article we...
130
click to vote
MICCAI
2009
Springer
16 years 5 months ago
2009
Springer
In this paper, we present a novel algorithm for non-rigidly registering two high angular resolution diffusion weighted MRIs (HARDI), each represented by a Gaussian mixture field (G...
141
click to vote
GLOBECOM
2007
IEEE
15 years 10 months ago
2007
IEEE
Abstract—Increasing interest in sensor networking and ubiquitous computing has created a trend towards embedding more and more intelligence into our surroundings. This enables th...
112
click to vote
POPL
1994
ACM
15 years 8 months ago
1994
ACM
This paper discusses call forwarding, a simple interprocedural optimization technique for dynamically typed languages. The basic idea behind the optimization is straightforward: n...