Sciweavers

5169 search results - page 455 / 1034
» Locality approximation using time
Sort
View
IJCAI
2007
15 years 9 months ago
Fast Incremental Square Root Information Smoothing
We propose a novel approach to the problem of simultaneous localization and mapping (SLAM) based on incremental smoothing, that is suitable for real-time applications in large-sca...
Michael Kaess, Ananth Ranganathan, Frank Dellaert
TMC
2011
108views more  TMC 2011»
15 years 2 months ago
Spatial-Temporal Coverage Optimization in Wireless Sensor Networks
—Mission-driven sensor networks usually have special lifetime requirements. However, the density of the sensors may not be large enough to satisfy the coverage requirement while ...
Changlei Liu, Guohong Cao
ACL
2011
14 years 11 months ago
A Large Scale Distributed Syntactic, Semantic and Lexical Language Model for Machine Translation
This paper presents an attempt at building a large scale distributed composite language model that simultaneously accounts for local word lexical information, mid-range sentence s...
Ming Tan, Wenli Zhou, Lei Zheng, Shaojun Wang
KDD
2008
ACM
165views Data Mining» more  KDD 2008»
16 years 8 months ago
Colibri: fast mining of large static and dynamic graphs
Low-rank approximations of the adjacency matrix of a graph are essential in finding patterns (such as communities) and detecting anomalies. Additionally, it is desirable to track ...
Hanghang Tong, Spiros Papadimitriou, Jimeng Sun, P...
PODS
2002
ACM
138views Database» more  PODS 2002»
16 years 7 months ago
Fast Algorithms For Hierarchical Range Histogram Construction
Data Warehousing and OLAPapplications typically view data as having multiple logical dimensions e.g., product, location with natural hierarchies de ned on each dimension. OLAP que...
Sudipto Guha, Nick Koudas, Divesh Srivastava