Sciweavers

844 search results - page 89 / 169
» Safraless Decision Procedures
Sort
View
IJCAI
1989
13 years 10 months ago
Preprocessing Search Spaces for Branch and Bound Search
Heuristic search procedures are useful in a large number of problems of practical importance. Such procedures operate by searching several paths in a search space at the same time...
Qiang Yang, Dana S. Nau
CVPR
2008
IEEE
14 years 10 months ago
Efficient sequential correspondence selection by cosegmentation
In many retrieval, object recognition and wide baseline stereo methods, correspondences of interest points are established possibly sublinearly by matching a compact descriptor su...
Jan Cech, Jiri Matas, Michal Perdoch
TIME
2009
IEEE
14 years 3 months ago
Fixing the Semantics for Dynamic Controllability and Providing a More Practical Characterization of Dynamic Execution Strategies
Morris, Muscettola and Vidal (MMV) presented an algorithm for checking the dynamic controllability (DC) of temporal networks in which certain temporal durations are beyond the con...
Luke Hunsberger
PKDD
2009
Springer
153views Data Mining» more  PKDD 2009»
14 years 3 months ago
Subspace Regularization: A New Semi-supervised Learning Method
Most existing semi-supervised learning methods are based on the smoothness assumption that data points in the same high density region should have the same label. This assumption, ...
Yan-Ming Zhang, Xinwen Hou, Shiming Xiang, Cheng-L...
KES
2005
Springer
14 years 2 months ago
A SVM Regression Based Approach to Filling in Missing Values
In KDD procedure, to fill in missing data typically requires a very large investment of time and energy - often 80% to 90% of a data analysis project is spent in making the data re...
Honghai Feng, Chen Guoshun, Yin Cheng, Bingru Yang...