Sciweavers

1548 search results - page 188 / 310
» Computational Approaches to Sentence Completion
Sort
View
MOBIHOC
2002
ACM
14 years 8 months ago
Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks
We present a series of approximation algorithms for finding a small weakly-connected dominating set (WCDS) in a given graph to be used in clustering mobile ad hoc networks. The st...
Yuanzhu Peter Chen, Arthur L. Liestman
SIGCSE
2010
ACM
169views Education» more  SIGCSE 2010»
14 years 3 months ago
Interfaces first (and foremost) with Java
ion is a critical concept that underlies many topics in computing science. For example, in software engineering, the distinction between a component’s behavior and its implement...
Paolo A. G. Sivilotti, Matthew Lang
DASFAA
2009
IEEE
133views Database» more  DASFAA 2009»
14 years 3 months ago
Probabilistic Ranking in Uncertain Vector Spaces
Abstract. In many application domains, e.g. sensor databases, traffic management or recognition systems, objects have to be compared based on positionally and existentially uncert...
Thomas Bernecker, Hans-Peter Kriegel, Matthias Ren...
CSE
2009
IEEE
14 years 3 months ago
Performance Analysis of an HMM-Based Gesture Recognition Using a Wristwatch Device
—Interaction with mobile devices that are intended for everyday use is challenging since such systems are continuously optimized towards small outlines. Watches are a particularl...
Roman Amstutz, Oliver Amft, Brian French, Asim Sma...
SEMCO
2009
IEEE
14 years 3 months ago
Understanding Implicit Entities and Events with Getaruns
- Semantic processing represents the new challenge for all applications that require text understanding, as for instance Q/A. In this paper we will highlight the need to couple sta...
Rodolfo Delmonte