Sciweavers

1420 search results - page 202 / 284
» Decision Making Using Probabilistic Inference Methods
Sort
View
DATE
2002
IEEE
113views Hardware» more  DATE 2002»
15 years 2 months ago
BerkMin: A Fast and Robust Sat-Solver
We describe a SAT-solver, BerkMin, that inherits such features of GRASP, SATO, and Chaff as clause recording, fast BCP, restarts, and conflict clause “aging”. At the same time...
Evguenii I. Goldberg, Yakov Novikov
SEAA
2008
IEEE
15 years 4 months ago
A Meta-model for the Assessment of Non-Functional Requirement Size
Non-functional requirements (NFRs) pose unique challenges in estimating the effort it would take to implement them. This is mainly because of their unique nature; NFRs are subject...
Mohamad Kassab, Maya Daneva, Olga Ormandjieva
CVPR
2012
IEEE
13 years 7 days ago
A tiered move-making algorithm for general pairwise MRFs
A large number of problems in computer vision can be modeled as energy minimization problems in a markov random field (MRF) framework. Many methods have been developed over the y...
Vibhav Vineet, Jonathan Warrell, Philip H. S. Torr
PODS
1998
ACM
152views Database» more  PODS 1998»
15 years 2 months ago
A Cost Model for Similarity Queries in Metric Spaces
We consider the problem of estimating CPU (distance computations) and I/O costs for processing range and k-nearest neighbors queries over metric spaces. Unlike the specific case ...
Paolo Ciaccia, Marco Patella, Pavel Zezula
CVPR
2011
IEEE
14 years 6 months ago
A Segmentation-aware Object Detection Model with Occlusion Handling
The bounding box representation employed by many popular object detection models [3, 6] implicitly assumes all pixels inside the box belong to the object. This assumption makes th...
Tianshi Gao, Benjamin Packer, Daphne Koller