3146 search results - page 12 / 630 » Efficient Consequence Finding |
MOR
2002
13 years 7 months ago
2002
ngly better objective function value until an optimal solution is reached. From an abstract point of view, an augmentation problem is solved in each iteration. That is, given a fea...
WCRE
2002
IEEE
14 years 14 days ago
2002
IEEE
Spreadsheets are a common tool in end-user programming. But even while important decisions are based on spreadsheet computations, spreadsheets are poorly documented software and t...
CVPR
2009
IEEE
15 years 2 months ago
2009
IEEE
In this work we propose a convex relaxation approach
for computing minimal partitions. Our approach is based
on rewriting the minimal partition problem (also known as
Potts mode...
COMPSYSTECH
2007
13 years 11 months ago
2007
: Internet offers a huge amount of didactic materials that can be used in creating new online courses. However, those materials need a deep analysis to understand their context and...
ISSAC
1995
Springer
13 years 11 months ago
1995
Springer
We present an efficient algorithm for testing whether a given integral polynomial has two distinct roots a, B such that fflp is a root of unity. The test is based on results obtai...