Sciweavers

2949 search results - page 414 / 590
» Universal Sparse Modeling
Sort
View
IJCNLP
2005
Springer
14 years 3 months ago
Exploring Syntactic Relation Patterns for Question Answering
Abstract. In this paper, we explore the syntactic relation patterns for opendomain factoid question answering. We propose a pattern extraction method to extract the various relatio...
Dan Shen, Geert-Jan M. Kruijff, Dietrich Klakow
IPSN
2005
Springer
14 years 3 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
14 years 3 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...
COMPGEOM
2004
ACM
14 years 3 months ago
Deformable spanners and applications
For a set S of points in Rd, an s-spanner is a graph on S such that any pair of points is connected via some path in the spanner whose total length is at most s times the Euclidea...
Jie Gao, Leonidas J. Guibas, An Nguyen
GC
2004
Springer
14 years 3 months ago
Verifying a Structured Peer-to-Peer Overlay Network: The Static Case
Abstract. Structured peer-to-peer overlay networks are a class of algorithms that provide efficient message routing for distributed applications using a sparsely connected communic...
Johannes Borgström, Uwe Nestmann, Luc Onana A...