2109 search results - page 239 / 422 » Solving Necklace Constraint Problems |
176
Voted
ICASSP
2011
IEEE
14 years 9 months ago
2011
IEEE
Owing to the non-zero probability of the missed detection and false alarm of active primary transmission, a certain degree of performance degradation of the primary user (PU) from...
148
click to vote
ICASSP
2011
IEEE
14 years 9 months ago
2011
IEEE
The multiplicative algorithms are well-known for nonnegative matrix and tensor factorizations. The ALS algorithm for canonical decomposition (CP) has been proved as a “workhorse...
203
Voted
CVPR
2012
IEEE
13 years 8 months ago
2012
IEEE
A novel method is proposed for matching articulated objects in cluttered videos. The method needs only a single exemplar image of the target object. Instead of using a small set o...
153
Voted
CPAIOR
2006
Springer
15 years 9 months ago
2006
Springer
Temporal planning (TP) is notoriously difficult because it requires to solve a propositional STRIPS planning problem with temporal constraints. In this paper, we propose an efficie...
165
click to vote
CP
2005
Springer
15 years 11 months ago
2005
Springer
The two most popular backtrack algorithms for solving Constraint Satisfaction Problems (CSPs) are Forward Checking (FC) and Maintaining Arc Consistency (MAC). MAC maintains full ar...