1692 search results - page 89 / 339 » Applying Science Models for Search |
ICPR
2008
IEEE
16 years 3 months ago
2008
IEEE
In this paper, we propose a novel component-wise smoothing algorithm that constructs a hierarchy (or family) of smoothened log-likelihood surfaces. Our approach first smoothens th...
116
Voted
NAACL
2007
15 years 4 months ago
2007
We propose a novel HMM-based framework to accurately transliterate unseen named entities. The framework leverages features in letteralignment and letter n-gram pairs learned from ...
120
click to vote
EMMCVPR
1999
Springer
15 years 6 months ago
1999
Springer
In this paper, we propose two Bayesian methods for detecting and grouping junctions. Our junction detection method evolves from the Kona approach, and it is based on a competitive ...
118
Voted
WG
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. We study graph searching games where a number of cops try to capture a robber that is hiding in a system of tunnels modelled as a graph. While the current position of the...
110
Voted
ACMSE
2004
ACM
15 years 8 months ago
2004
ACM
This paper presents a distributed multi-robot system designed to solve a team-based search and destroy task. The project was divided into two phases. The initial phase was used to...