Sciweavers

9405 search results - page 1107 / 1881
» Computing a Model of Set Theory
Sort
View
CVPR
2010
IEEE
16 years 4 months ago
Building Reconstruction using Manhattan-World Grammars
We present a passive computer vision method that exploits existing mapping and navigation databases in order to automatically create 3D building models. Our method defines a gramm...
Carlos Vanegas, Daniel Aliaga, Bedrich Benes
COORDINATION
2006
Springer
15 years 9 months ago
Enabling Ubiquitous Coordination Using Application Sessions
Abstract. Enabling coordination among ubiquitous computing applicad resources requires programming abstractions and development tools tailored to this unique environment. This pape...
Christine Julien, Drew Stovall
STOC
2009
ACM
181views Algorithms» more  STOC 2009»
16 years 8 months ago
The detectability lemma and quantum gap amplification
The quantum analog of a constraint satisfaction problem is a sum of local Hamiltonians - each (term of the) Hamiltonian specifies a local constraint whose violation contributes to...
Dorit Aharonov, Itai Arad, Zeph Landau, Umesh V. V...
CCS
2009
ACM
16 years 2 months ago
On non-cooperative location privacy: a game-theoretic analysis
In mobile networks, authentication is a required primitive of the majority of security protocols. However, an adversary can track the location of mobile nodes by monitoring pseudo...
Julien Freudiger, Mohammad Hossein Manshaei, Jean-...
IPSN
2004
Springer
16 years 27 days ago
Lattice sensor networks: capacity limits, optimal routing and robustness to failures
We study network capacity limits and optimal routing algorithms for regular sensor networks, namely, square and torus grid sensor networks, in both, the static case (no node failu...
Guillermo Barrenechea, Baltasar Beferull-Lozano, M...
« Prev « First page 1107 / 1881 Last » Next »