Sciweavers

1012 search results - page 125 / 203
» Segment intersection searching problems in general settings
Sort
View
AUTOMATICA
2008
75views more  AUTOMATICA 2008»
14 years 12 months ago
Optimal complexity reduction of polyhedral piecewise affine systems
This paper focuses on the NP-hard problem of reducing the complexity of piecewise polyhedral systems (e.g. polyhedral piecewise affine (PWA) systems). The results are fourfold. Fi...
Tobias Geyer, Fabio Danilo Torrisi, Manfred Morari
SAC
2008
ACM
14 years 11 months ago
Trajectory retrieval with latent semantic analysis
The problem of trajectory similarity has been recently attracted research interest considerably, due to its importance in diverse fields. In this work, we study trajectory similar...
Apostolos N. Papadopoulos
SIGIR
2012
ACM
13 years 2 months ago
Automatic term mismatch diagnosis for selective query expansion
People are seldom aware that their search queries frequently mismatch a majority of the relevant documents. This may not be a big problem for topics with a large and diverse set o...
Le Zhao, Jamie Callan
MIR
2004
ACM
143views Multimedia» more  MIR 2004»
15 years 5 months ago
A graphical user interface for a fine-art painting image retrieval system
For describing and analyzing digital images of paintings we propose a model to serve as the basis for an interactive image retrieval system. The model defines two types of feature...
Thomas E. Lombardi, Sung-Hyuk Cha, Charles C. Tapp...
ATAL
2009
Springer
15 years 6 months ago
Evaluating hybrid constraint tightening for scheduling agents
Hybrid Scheduling Problems (HSPs) combine temporal and finite-domain variables via hybrid constraints that dictate that specific bounds on temporal constraints rely on assignments...
James C. Boerkoel Jr., Edmund H. Durfee