Sciweavers

1402 search results - page 235 / 281
» Sparse-Memory Graph Search
Sort
View
AAAI
2008
15 years 2 months ago
Efficient Optimization of Information-Theoretic Exploration in SLAM
We present a novel method for information-theoretic exploration, leveraging recent work on mapping and localization. We describe exploration as the constrained optimization proble...
Thomas Kollar, Nicholas Roy
CIKM
2008
Springer
15 years 1 months ago
Query suggestion using hitting time
Generating alternative queries, also known as query suggestion, has long been proved useful to help a user explore and express his information need. In many scenarios, such sugges...
Qiaozhu Mei, Dengyong Zhou, Kenneth Ward Church
DASFAA
2008
IEEE
94views Database» more  DASFAA 2008»
15 years 1 months ago
Efficient Algorithms for Node Disjoint Subgraph Homeomorphism Determination
Recently, great efforts have been dedicated to researches on the management of large-scale graph-based data, where node disjoint subgraph homeomorphism relation between graphs has ...
Yanghua Xiao, Wentao Wu, Wei Wang 0009, Zhenying H...
ACL
2007
15 years 1 months ago
Extending MARIE: an N-gram-based SMT decoder
In this paper we present several extensions of MARIE1 , a freely available N-gram-based statistical machine translation (SMT) decoder. The extensions mainly consist of the ability...
Josep Maria Crego, José B. Mariño
COLING
2000
15 years 1 months ago
Generation, Lambek Calculus, Montague's Semantics and Semantic Proof Nets
Most of the studies in the framework of Lambek calculus have considered the parsing process and ignored the generation process. This paper wants to rely on the close link between ...
Sylvain Pogodalla