Sciweavers

1963 search results - page 183 / 393
» The Maximum Solution Problem on Graphs
Sort
View
IJCAI
2001
15 years 4 months ago
Backbones in Optimization and Approximation
We study the impact of backbones in optimization and approximation problems. We show that some optimization problems like graph coloring resemble decision problems, with problem h...
John K. Slaney, Toby Walsh
ICASSP
2008
IEEE
15 years 9 months ago
Efficient soft demodulation of MIMO QPSK via semidefinite relaxation
We develop a computationally efficient and memory efficient approach to (near) maximum a posteriori probability demodulation for MIMO systems with QPSK signalling, based on semi...
Mehran Nekuii, Mikalai Kisialiou, Timothy N. David...
ICDM
2002
IEEE
118views Data Mining» more  ICDM 2002»
15 years 8 months ago
Mining Surveillance Video for Independent Motion Detection
This paper addresses the special applications of data mining techniques in homeland defense. The problem targeted, which is frequently encountered in military/intelligence surveil...
Zhongfei Zhang
DAM
2011
14 years 10 months ago
Weak sense of direction labelings and graph embeddings
An edge-labeling λ for a directed graph G has a weak sense of direction (WSD) if there is a function f that satisfies the condition that for any node u and for any two label seq...
Christine T. Cheng, Ichiro Suzuki
125
Voted
ICPR
2002
IEEE
16 years 4 months ago
Relational Graph Labelling Using Learning Techniques and Markov Random Fields
This paper introduces an approach for handling complex labelling problems driven by local constraints. The purpose is illustrated by two applications: detection of the road networ...
Denis Rivière, Jean-Francois Mangin, Jean-M...