Sciweavers

9842 search results - page 367 / 1969
» Problem complexity
Sort
View
CP
2004
Springer
16 years 8 days ago
Challenges for Constraint Programming in Networking
In this talk we present a number of problems for network design, planning and analysis and show how they can be addressed with different hybrid CP solutions. Clearly, this problem...
Helmut Simonis
IJCV
2006
107views more  IJCV 2006»
15 years 6 months ago
Behavioral Priors for Detection and Tracking of Pedestrians in Video Sequences
In this paper we address the problem of detection and tracking of pedestrians in complex scenarios. The inclusion of prior knowledge is more and more crucial in scene analysis to g...
Gianluca Antonini, Santiago Venegas-Martinez, Mich...
CIE
2007
Springer
15 years 8 months ago
Finding Most Likely Solutions
Abstract. As one simple type of statistical inference problems we consider Most Likely Solution problem, a task of finding a most likely solution (MLS in short) for a given proble...
Osamu Watanabe, Mikael Onsjö
ICASSP
2011
IEEE
14 years 10 months ago
A reweighted least squares algorithm for detection of QAM signaling in MIMO channels
This paper proposes a reweighted least squares algorithm for quadrature amplitude modulation (QAM) detector in multiple-input multiple-output (MIMO) channels. Although the QAM det...
Katsumi Konishi, Toshihiro Furukawa
UML
2001
Springer
15 years 11 months ago
Using Alloy and UML/OCL to Specify Run-Time Configuration Management: A Case Study
: There are many different ways to specify the requirements of complex software systems, and the optimal methods often vary according to the problem domain. We apply and compare tw...
Geri Georg, Jores Bieman, Robert B. France