Sciweavers

3656 search results - page 22 / 732
» Compact Location Problems
Sort
View
ICNP
2007
IEEE
14 years 4 months ago
HEXA: Compact Data Structures for Faster Packet Processing
—Data structures representing directed graphs with edges labeled by symbols from a finite alphabet are used to implement packet processing algorithms used in a variety of network...
Sailesh Kumar, Jonathan S. Turner, Patrick Crowley...
IPSN
2007
Springer
14 years 4 months ago
A compact, high-speed, wearable sensor network for biomotion capture and interactive media
In this paper, we present a wireless sensor platform designed for processing multipoint human motion with low latency and high resolution. One application considered here is inter...
Ryan Aylward, Joseph A. Paradiso
COMPGEOM
1990
ACM
14 years 1 months ago
Finding Compact Coordinate Representations for Polygons and Polyhedra
Practical solid modeling systems are plagued by numerical problems that arise from using oatingpoint arithmetic. For example, polyhedral solids are often represented by a combinat...
Victor Milenkovic, Lee R. Nackman
CP
2009
Springer
14 years 10 months ago
Coalition Structure Generation Utilizing Compact Characteristic Function Representations
This paper presents a new way of formalizing the Coalition Structure Generation problem (CSG), so that we can apply constraint optimization techniques to it. Forming effective coal...
Naoki Ohta, Vincent Conitzer, Ryo Ichimura, Yuko S...
LOCA
2009
Springer
14 years 4 months ago
Location Diversity: Enhanced Privacy Protection in Location Based Services
Abstract. Location-based Services are emerging as popular applications in pervasive computing. Spatial k-anonymity is used in Locationbased Services to protect privacy, by hiding t...
Mingqiang Xue, Panos Kalnis, Hung Keng Pung