Sciweavers

391 search results - page 70 / 79
» Locally Consistent Constraint Satisfaction Problems with Bin...
Sort
View
AIPS
2007
13 years 9 months ago
Bounding the Resource Availability of Activities with Linear Resource Impact
We introduce the Linear Resource Temporal Network (LRTN), which consists of activities that consume or produce a resource, subject to absolute and relative metric temporal constra...
Jeremy Frank, Paul H. Morris
FOCS
2007
IEEE
14 years 1 months ago
Maximizing Non-Monotone Submodular Functions
Submodular maximization generalizes many important problems including Max Cut in directed/undirected graphs and hypergraphs, certain constraint satisfaction problems and maximum f...
Uriel Feige, Vahab S. Mirrokni, Jan Vondrák
TSP
2010
13 years 1 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
3DPVT
2004
IEEE
119views Visualization» more  3DPVT 2004»
13 years 10 months ago
Synthetic Image of Multiresolution Sketch Leads to New Features
A new approach to construction of robust features is proposed and applied to an instance of the correspondence problem. The main idea is to construct a synthetic image by a multir...
Georgii Khachaturov, Rafael Moncayo-Muños
ALGORITHMICA
2006
139views more  ALGORITHMICA 2006»
13 years 6 months ago
CONQUEST: A Coarse-Grained Algorithm for Constructing Summaries of Distributed Discrete Datasets
Abstract. In this paper we present a coarse-grained parallel algorithm, CONQUEST, for constructing boundederror summaries of high-dimensional binary attributed data in a distribute...
Jie Chi, Mehmet Koyutürk, Ananth Grama