4342 search results - page 390 / 869 » Improved Algorithms for Optimal Embeddings |
171
click to vote
JAIR
2007
15 years 6 months ago
2007
Many combinatorial optimization problems such as the bin packing and multiple knapsack problems involve assigning a set of discrete objects to multiple containers. These problems ...
187
click to vote
BMVC
2010
15 years 4 months ago
2010
We introduce a novel bilinear boosting algorithm, which extends the multi-class boosting framework of JointBoost to optimize a bilinear objective function. This allows style param...
218
click to vote
MOBIHOC
2003
ACM
16 years 6 months ago
2003
ACM
On demand routing protocols provide scalable and costeffective solutions for packet routing in mobile wireless ad hoc networks. The paths generated by these protocols may deviate ...
202
click to vote
MTV
2003
IEEE
16 years 4 days ago
2003
IEEE
Bounded Model Checking (BMC) techniques have been used for formal hardware verification, with the help of tools such as GRASP (Generic search Algorithm for Satisfiability Proble...
160
click to vote
CGF
2006
15 years 7 months ago
2006
Many algorithms in computer graphics improve their efficiency by using Hierarchical Space Subdivision Schemes (HS3), such as octrees, kD-trees or BSP trees. Such HS3 usually provi...