16091 search results - page 352 / 3219 » Solving |
177
click to vote
ICPPW
2006
IEEE
16 years 22 days ago
2006
IEEE
Homotopy methods to solve polynomial systems are well suited for parallel computing because the solution paths defined by the homotopy can be tracked independently. For sparse po...
139
click to vote
ICSEA
2006
IEEE
16 years 22 days ago
2006
IEEE
ey operate with computer abstractions not with AD ions they cannot fully bridge the semantic gap between IT and AD. Therefore, we can safely conclude that the research on computer ...
210
click to vote
IIHMSP
2006
IEEE
16 years 21 days ago
2006
IEEE
This paper presents a new behavior classification system for analyzing human movements directly from video sequences. First of all, we propose a triangulation-based method to tran...
179
click to vote
IPPS
2006
IEEE
16 years 21 days ago
2006
IEEE
— Many interesting problems in graph theory can be reduced to solving an eigenproblem of the adjacency matrix or Laplacian of a graph. Given the availability of high-quality line...
160
click to vote
ISCAS
2006
IEEE
16 years 21 days ago
2006
IEEE
— All-solution Boolean satisfiability (SAT) solvers are engines employed to find all the possible solutions to a SAT problem. Their applications are found throughout the EDA in...