Sciweavers

2489 search results - page 226 / 498
» On the Subgroup Distance Problem
Sort
View
PRICAI
2004
Springer
15 years 10 months ago
Constrained Ant Colony Optimization for Data Clustering
Processes that simulate natural phenomena have successfully been applied to a number of problems for which no simple mathematical solution is known or is practicable. Such meta-heu...
Shu-Chuan Chu, John F. Roddick, Che-Jen Su, Jeng-S...
KCAP
2003
ACM
15 years 10 months ago
Using transformations to improve semantic matching
Many AI tasks require determining whether two knowledge representations encode the same knowledge. Solving this matching problem is hard because representations may encode the sam...
Peter Z. Yeh, Bruce W. Porter, Ken Barker
MDM
2010
Springer
209views Communications» more  MDM 2010»
15 years 9 months ago
An Interactive-Voting Based Map Matching Algorithm
—Matching a raw GPS trajectory to roads on a digital map is often referred to as the Map Matching problem. However, the occurrence of the low-sampling-rate trajectories (e.g. one...
Jing Yuan, Yu Zheng, Chengyang Zhang, Xing Xie, Gu...
CDC
2009
IEEE
15 years 9 months ago
Metrics on the space of bounded Keplerian orbits and space situational awareness
— A main difficulty for orbit determination of space debris is the correlation of tracks of data belonging to the same physical object. A sequence of optical measurements of an ...
Jared M. Maruskin, Daniel J. Scheeres
COMPGEOM
2007
ACM
15 years 8 months ago
Streaming algorithms for line simplification
We study the following variant of the well-known line-simplification problem: we are getting a possibly infinite sequence of points p0, p1, p2, . . . in the plane defining a polyg...
Mohammad Ali Abam, Mark de Berg, Peter Hachenberge...