Sciweavers

405 search results - page 66 / 81
» On the Complexity of Global Constraint Satisfaction
Sort
View
TSP
2010
14 years 4 months ago
Optimal linear fusion for distributed detection via semidefinite programming
Consider the problem of signal detection via multiple distributed noisy sensors. We propose a linear decision fusion rule to combine the local statistics from individual sensors i...
Zhi Quan, Wing-Kin Ma, Shuguang Cui, Ali H. Sayed
ICIP
2005
IEEE
15 years 11 months ago
Color signal decomposition method using 3-D Gamut boundary of multi-primary display
Color signal decomposition method is to decompose the conventional three-primary colors(RGB) into the multiprimary control values of multi-primary display(MPD) under the constraint...
Dong-Woo Kang, Yang-Ho Cho, Myong-Young Lee, Tae-Y...
95
Voted
PODS
2007
ACM
159views Database» more  PODS 2007»
15 years 9 months ago
Generalized hypertree decompositions: np-hardness and tractable variants
The generalized hypertree width GHW(H) of a hypergraph H is a measure of its cyclicity. Classes of conjunctive queries or constraint satisfaction problems whose associated hypergr...
Georg Gottlob, Thomas Schwentick, Zoltán Mi...
DCOSS
2007
Springer
15 years 3 months ago
Distributed Coalition Formation in Visual Sensor Networks: A Virtual Vision Approach
Abstract. We propose a distributed coalition formation strategy for collaborative sensing tasks in camera sensor networks. The proposed model supports taskdependent node selection ...
Faisal Qureshi, Demetri Terzopoulos
CIAC
2003
Springer
98views Algorithms» more  CIAC 2003»
15 years 2 months ago
Improving Customer Proximity to Railway Stations
Abstract. We consider problems of (new) station placement along (existing) railway tracks, so as to increase the number of users. We prove that, in spite of the NP-hardness for the...
Evangelos Kranakis, Paolo Penna, Konrad Schlude, D...