Sciweavers

1897 search results - page 167 / 380
» Sparse Additive Machine
Sort
View
DCOSS
2005
Springer
15 years 10 months ago
Distributed Proximity Maintenance in Ad Hoc Mobile Networks
We present an efficient distributed data structure, called the D-SPANNER, for maintaining proximity information among communicating mobile nodes. The D-SPANNER is a kinetic sparse...
Jie Gao, Leonidas J. Guibas, An Nguyen
IJCNLP
2005
Springer
15 years 10 months ago
A Lexicon-Constrained Character Model for Chinese Morphological Analysis
Abstract. This paper proposes a lexicon-constrained character model that combines both word and character features to solve complicated issues in Chinese morphological analysis. A ...
Yao Meng, Hao Yu, Fumihito Nishino
167
Voted
IPSN
2005
Springer
15 years 10 months ago
Tracking on a graph
Abstract— This paper considers the problem of tracking objects with sparsely located binary sensors. Tracking with a sensor network is a challenging task due to the inaccuracy of...
Songhwai Oh, Shankar Sastry
ITRUST
2005
Springer
15 years 10 months ago
Alleviating the Sparsity Problem of Collaborative Filtering Using Trust Inferences
Collaborative Filtering (CF), the prevalent recommendation approach, has been successfully used to identify users that can be characterized as “similar” according to their logg...
Manos Papagelis, Dimitris Plexousakis, Themistokli...
CP
2004
Springer
15 years 10 months ago
How Much Backtracking Does It Take to Color Random Graphs? Rigorous Results on Heavy Tails
Many backtracking algorithms exhibit heavy-tailed distributions, in which their running time is often much longer than their median. We analyze the behavior of two natural variant...
Haixia Jia, Cristopher Moore