5592 search results - page 917 / 1119 » On Random Betweenness Constraints |
172
click to vote
COMPGEOM
2008
ACM
15 years 8 months ago
2008
ACM
This video illustrates an algorithm for computing a maximum number of disjoint paths for unit disks moving among a set of dynamic obstacles in the plane. The problem is motivated ...
171
click to vote
CPAIOR
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. Replication is a fundamental technique for increasing throughput and achieving fault tolerance in distributed data services. However, its implementation may induce signif...
156
click to vote
CSCW
2008
ACM
15 years 8 months ago
2008
ACM
Coordinating goals, schedules, and tasks among collaborators is difficult, and made even more so when there are disciplinary, geographic and institutional boundaries that must be ...
193
click to vote
ICA
2007
Springer
15 years 8 months ago
2007
Springer
In this paper, we propose a Bayesian estimation approach to extend independent subspace analysis (ISA) for an overcomplete representation without imposing the orthogonal constraint...
177
click to vote
EUC
2008
Springer
15 years 8 months ago
2008
Springer
Context-awareness is a key issue in pervasive computing. Context-aware applications are prone to the context consistency problem, where applications are confronted with conflictin...