Sciweavers

4451 search results - page 2 / 891
» On Random Ordering Constraints
Sort
View
IJCAI
1989
13 years 6 months ago
Ordering Problem Subgoals
Most past research work on problem subgoal ordering are of a heuristic nature and very little attempt has been made to reveal the inherent relationship between subgoal ordering co...
Jie Cheng, Keki B. Irani
FCT
2009
Springer
13 years 11 months ago
On Random Betweenness Constraints
Despite of their applicability betweennness constraints have (to the authorā€™s knowledge) hardly been considered from the random structures point of view. They are essentially diļ...
Andreas Goerdt
CVPR
2005
IEEE
14 years 7 months ago
Object Detection Using 2D Spatial Ordering Constraints
Object detection is challenging partly due to the limited discriminative power of local feature descriptors. We amend this limitation by incorporating spatial constraints among ne...
Yan Li, Yanghai Tsin, Yakup Genc, Takeo Kanade
CORR
2006
Springer
107views Education» more  CORR 2006»
13 years 5 months ago
Dense Gaussian Sensor Networks: Minimum Achievable Distortion and the Order Optimality of Separation
We investigate the optimal performance of dense sensor networks by studying the joint source-channel coding problem. The overall goal of the sensor network is to take measurements...
Nan Liu, Sennur Ulukus
FOCS
2008
IEEE
13 years 11 months ago
Beating the Random Ordering is Hard: Inapproximability of Maximum Acyclic Subgraph
We prove that approximating the Max Acyclic Subgraph problem within a factor better than 1/2 is Unique-Games hard. Speciļ¬cally, for every constant Īµ > 0 the following holds:...
Venkatesan Guruswami, Rajsekar Manokaran, Prasad R...