Sciweavers

2489 search results - page 320 / 498
» On the Subgroup Distance Problem
Sort
View
TMC
2012
13 years 6 months ago
Sensing Driver Phone Use with Acoustic Ranging through Car Speakers
—This work addresses the fundamental problem of distinguishing between a driver and passenger using a mobile phone, which is the critical input to enable numerous safety and inte...
Jie Yang 0003, Simon Sidhom, Gayathri Chandrasekar...
KDD
2006
ACM
159views Data Mining» more  KDD 2006»
16 years 4 months ago
Global distance-based segmentation of trajectories
This work introduces distance-based criteria for segmentation of object trajectories. Segmentation leads to simplification of the original objects into smaller, less complex primi...
Aris Anagnostopoulos, Michail Vlachos, Marios Hadj...
145
Voted
MOBIHOC
2005
ACM
16 years 3 months ago
Localization and routing in sensor networks by local angle information
Location information is very useful in the design of sensor network infrastructures. In this paper, we study the anchor-free 2D localization problem by using local angle measureme...
Jehoshua Bruck, Jie Gao, Anxiao Jiang
DEM
2001
Springer
247views GIS» more  DEM 2001»
15 years 8 months ago
Procedural Geometry for Real-Time Terrain Visualisation in Blueberry3D
A common concern of the real−time terrain visualisation of today is the lack of geometric detail, when the terrain model is studied close enough. This is primary not a problem of...
Mattias Widmark
WADS
1993
Springer
163views Algorithms» more  WADS 1993»
15 years 8 months ago
Minimum Weight Euclidean Matching and Weighted Relative Neighborhood Graphs
The Minimum Weight Euclidean Matching (MWEM) problem is: given 2n point sites in the plane with Euclidean metric for interpoint distances, match the sites into n pairs so that the...
Andy Mirzaian