Sciweavers

1383 search results - page 161 / 277
» On the Complexity of the Interlace Polynomial
Sort
View
DEXA
2008
Springer
87views Database» more  DEXA 2008»
15 years 8 months ago
Tracking Moving Objects in Anonymized Trajectories
Multiple target tracking (MTT) is a well-studied technique in the field of radar technology, which associates anonymized measurements with the appropriate object trajectories. This...
Nikolay Vyahhi, Spiridon Bakiras, Panos Kalnis, Ga...
NIPS
2007
15 years 7 months ago
What makes some POMDP problems easy to approximate?
Point-based algorithms have been surprisingly successful in computing approximately optimal solutions for partially observable Markov decision processes (POMDPs) in high dimension...
David Hsu, Wee Sun Lee, Nan Rong
SDM
2007
SIAM
171views Data Mining» more  SDM 2007»
15 years 7 months ago
A Better Alternative to Piecewise Linear Time Series Segmentation
Time series are difficult to monitor, summarize and predict. Segmentation organizes time series into few intervals having uniform characteristics (flatness, linearity, modality,...
Daniel Lemire
AAAI
2006
15 years 7 months ago
Algorithms for Rationalizability and CURB Sets
Significant work has been done on computational aspects of solving games under various solution concepts, such as Nash equilibrium, subgame perfect Nash equilibrium, correlated eq...
Michael Benisch, George B. Davis, Tuomas Sandholm
DAGSTUHL
2004
15 years 7 months ago
Information-Based Nonlinear Approximation: An Average Case Setting
Nonlinear approximation has usually been studied under deterministic assumptions and complete information about the underlying functions. In the present paper we assume only partia...
Leszek Plaskota