2969 search results - page 133 / 594 » A space efficient algorithm for group structure computation |
122
click to vote
ISCAS
2003
IEEE
15 years 8 months ago
2003
IEEE
– The traditional way of approaching placement problems in computer-aided design (CAD) tools for analog layout is to explore an extremely large search space of feasible or unfeas...
131
click to vote
IJCAI
2003
15 years 4 months ago
2003
Refinement operators for theories avoid the problems related to the myopia of many relational learning algorithms based on the operators that refine single clauses. However, the n...
131
Voted
IJRR
2002
15 years 3 months ago
2002
We present kinetic data structures for detecting collisions between a set of polygons that are moving continuously. Unlike classical collision detection methods that rely on bound...
132
click to vote
STOC
2009
ACM
16 years 4 months ago
2009
ACM
The low-rank matrix approximation problem involves finding of a rank k version of a m ? n matrix AAA, labeled AAAk, such that AAAk is as "close" as possible to the best ...
120
Voted
JNW
2006
15 years 3 months ago
2006
Abstract--Highly distributed environments such as pervasive computing environments not having global or broad control, need another attribute certificate management technique. For ...