Sciweavers

1651 search results - page 222 / 331
» Measuring the Complexity of Classification Problems
Sort
View
SIAMCOMP
1998
125views more  SIAMCOMP 1998»
13 years 7 months ago
Free Bits, PCPs, and Nonapproximability-Towards Tight Results
This paper continues the investigation of the connection between probabilistically checkable proofs (PCPs) and the approximability of NP-optimization problems. The emphasis is on p...
Mihir Bellare, Oded Goldreich, Madhu Sudan
KDD
2006
ACM
159views Data Mining» more  KDD 2006»
14 years 8 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...
TSMC
2008
225views more  TSMC 2008»
13 years 8 months ago
Robust Methods for Geometric Primitive Recovery and Estimation From Range Images
We present a method for the recovery of partially occluded 3D geometric primitives from range images which might also include non-primitive objects. The method uses a technique for...
Irina Lavva, Eyal Hameiri, Ilan Shimshoni
PODS
2008
ACM
211views Database» more  PODS 2008»
14 years 8 months ago
The power of two min-hashes for similarity search among hierarchical data objects
In this study we propose sketching algorithms for computing similarities between hierarchical data. Specifically, we look at data objects that are represented using leaf-labeled t...
Sreenivas Gollapudi, Rina Panigrahy
SAC
2010
ACM
14 years 3 months ago
Tracking random finite objects using 3D-LIDAR in marine environments
This paper presents a random finite set theoretic formulation for multi-object tracking as perceived by a 3D-LIDAR in a dynamic environment. It is mainly concerned with the joint...
Kwang Wee Lee, Bharath Kalyan, W. Sardha Wijesoma,...