Sciweavers

263 search results - page 25 / 53
» Efficient Variants of the ICP Algorithm
Sort
View
CORR
2010
Springer
151views Education» more  CORR 2010»
14 years 8 months ago
Selective Call Out and Real Time Bidding
Display ads on the Internet are increasingly sold via ad exchanges such as RightMedia, AdECN and Doubleclick Ad Exchange. These exchanges allow real-time bidding, that is, each ti...
Tanmoy Chakraborty, Eyal Even-Dar, Sudipto Guha, Y...
GIS
2006
ACM
16 years 25 days ago
Computing longest duration flocks in trajectory data
Moving point object data can be analyzed through the discovery of patterns. We consider the computational efficiency of computing two of the most basic spatio-temporal patterns in...
Joachim Gudmundsson, Marc J. van Kreveld
ICDM
2009
IEEE
133views Data Mining» more  ICDM 2009»
14 years 9 months ago
Clustering Trajectories of Moving Objects in an Uncertain World
Mining Trajectory Databases (TD) has recently gained great interest due to the popularity of tracking devices. On the other hand, the inherent presence of uncertainty in TD (e.g.,...
Nikos Pelekis, Ioannis Kopanakis, Evangelos E. Kot...
COCOON
2008
Springer
15 years 1 months ago
Polychromatic Colorings of n-Dimensional Guillotine-Partitions
A strong hyperbox-respecting coloring of an n-dimensional hyperbox partition is a coloring of the corners of its hyperboxes with 2n colors such that any hyperbox has all the colors...
Balázs Keszegh
TCS
2008
14 years 11 months ago
A unified approach to finding good stable matchings in the hospitals/residents setting
The hospitals/residents (HR) problem is a many-to-one generalization of the stable marriage (SM) problem. Researchers have been interested in variants of stable matchings that eit...
Christine Cheng, Eric McDermid, Ichiro Suzuki