Sciweavers

2446 search results - page 68 / 490
» Where am I
Sort
View
HUC
2011
Springer
12 years 9 months ago
Are you close with me? are you nearby?: investigating social groups, closeness, and willingness to share
As ubiquitous computing becomes increasingly mobile and social, personal information sharing will likely increase in frequency, the variety of friends to share with, and range of ...
Jason Wiese, Patrick Gage Kelley, Lorrie Faith Cra...
PSIVT
2007
Springer
143views Multimedia» more  PSIVT 2007»
14 years 4 months ago
Approximate ESPs on Surfaces of Polytopes Using a Rubberband Algorithm
Let p and q be two points on the surface of a polytope Π. This paper provides a rubberband algorithm for computing a Euclidean shortest path between p and q (a so-called surface E...
Fajie Li, Reinhard Klette, Xue Fu
COMBINATORICS
2006
105views more  COMBINATORICS 2006»
13 years 10 months ago
Edge-Magic Group Labellings of Countable Graphs
We investigate the existence of edge-magic labellings of countably infinite graphs by abelian groups. We show for that for a large class of abelian groups, including the integers ...
Nicholas J. Cavenagh, Diana Combe, Adrian M. Nelso...
APPROX
2005
Springer
122views Algorithms» more  APPROX 2005»
14 years 3 months ago
Finding a Maximum Independent Set in a Sparse Random Graph
We consider the problem of finding a maximum independent set in a random graph. The random graph G, which contains n vertices, is modelled as follows. Every edge is included inde...
Uriel Feige, Eran Ofek
CVPR
2012
IEEE
12 years 12 days ago
Rolling shutter bundle adjustment
This paper introduces a bundle adjustment (BA) method that obtains accurate structure and motion from rolling shutter (RS) video sequences: RSBA. When a classical BA algorithm pro...
Johan Hedborg, Per-Erik Forssén, Michael Fe...