728 search results - page 105 / 146 » Efficient Searching with Linear Constraints |
150
click to vote
IJCAI
2001
15 years 7 months ago
2001
Boolean linear programs (BLPs) are ubiquitous in AI. Satisfiability testing, planning with resource constraints, and winner determination in combinatorial auctions are all example...
290
Voted
TPDS
2008
15 years 5 months ago
2008
Multiple applications that execute concurrently on heterogeneous platforms compete for CPU and network resources. In this paper, we consider the problem of scheduling applications ...
143
click to vote
CVPR
2006
IEEE
16 years 8 months ago
2006
IEEE
We propose human action detection based on a successive convex matching scheme. Human actions are represented as sequences of postures and specific actions are detected in video b...
155
click to vote
ICML
2005
IEEE
16 years 6 months ago
2005
IEEE
We consider support vector machines for binary classification. As opposed to most approaches we use the number of support vectors (the "L0 norm") as a regularizing term ...
143
click to vote
ISCAS
2005
IEEE
15 years 11 months ago
2005
IEEE
In high-level synthesis, accurate lower-bound estimation is helpful to explore the search space efficiently and to evaluate the quality of heuristic algorithms. For the lower-bound...