15485 search results - page 140 / 3097 » Computing Optimal Subsets |
122
Voted
COCOON
2008
Springer
15 years 4 months ago
2008
Springer
We study the problem of adding k new links to a directed graph G(V, E) in order to maximize the minimum PageRank value for a given subset of the nodes. We show that this problem is...
101
Voted
PERCOM
2008
ACM
16 years 2 months ago
2008
ACM
This paper identifies requirements for querying and accessing context information in mobile and pervasive computing environments. Furthermore it studies existing query languages s...
113
Voted
EUSAI
2007
Springer
15 years 8 months ago
2007
Springer
Localization technologies have been an important focus in ubiquitous computing. This paper explores an underrepresented area, namely computer vision technology, for outdoor positio...
128
Voted
CSCWD
2008
Springer
15 years 4 months ago
2008
Springer
Design is a complex process often described as a collaboration between a designer and herself. In architectural design, a designer must consider the selection of a subset of actio...
114
click to vote
DGCI
2008
Springer
15 years 4 months ago
2008
Springer
Based on a classical convex hull algorithm called Gift-Wrapping, the purpose of the paper is to provide a new algorithm for computing the vertices of a polytope called preimage - ...