Sciweavers

969 search results - page 176 / 194
» A New Metric Between Polygons and How to Compute it
Sort
View
MOBIHOC
2005
ACM
14 years 8 months ago
A distributed coordination framework for wireless sensor and actor networks
Wireless Sensor and Actor Networks (WSANs) are composed of a large number of heterogeneous nodes called sensors and actors. The collaborative operation of sensors enables the dist...
Tommaso Melodia, Dario Pompili, Vehbi C. Gungor, I...
ACMACE
2005
ACM
14 years 2 months ago
Possession techniques for interaction in real-time strategy augmented reality games
There have been a number of interactive games created for Augmented Reality (AR) environments. In this paper, interaction techniques to support Real-Time Strategy (RTS) games in A...
Keith Phillips, Wayne Piekarski
COCO
2005
Springer
110views Algorithms» more  COCO 2005»
14 years 2 months ago
Prior Entanglement, Message Compression and Privacy in Quantum Communication
Consider a two-party quantum communication protocol for computing some function f : {0, 1}n × {0, 1}n → Z. We show that the first message of P can be compressed to O(k) classi...
Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen
ISPD
2004
ACM
189views Hardware» more  ISPD 2004»
14 years 2 months ago
Almost optimum placement legalization by minimum cost flow and dynamic programming
VLSI placement tools usually work in two steps: First, the cells that have to be placed are roughly spread out over the chip area ignoring disjointness (global placement). Then, i...
Ulrich Brenner, Anna Pauli, Jens Vygen
FOCS
1999
IEEE
14 years 28 days ago
Near-Optimal Conversion of Hardness into Pseudo-Randomness
Various efforts ([?, ?, ?]) have been made in recent years to derandomize probabilistic algorithms using the complexity theoretic assumption that there exists a problem in E = dti...
Russell Impagliazzo, Ronen Shaltiel, Avi Wigderson