32545 search results - page 6361 / 6509 » Data Structures and Algorithms |
156
click to vote
CC
2006
Springer
15 years 8 months ago
2006
Springer
The polyhedral model is known to be a powerful framework to reason about high level loop transformations. Recent developments in optimizing compilers broke some generally accepted ...
177
Voted
CLEAR
2006
Springer
15 years 8 months ago
2006
Springer
We present the IBM systems submitted and evaluated within the CLEAR'06 evaluation campaign for the tasks of single person visual 3D tracking (localization) and 2D face trackin...
152
click to vote
ISSTA
2010
ACM
15 years 8 months ago
2010
ACM
Recently, there has been much interest in developing analyzes to detect concurrency bugs that arise because of data races, atomicity violations, execution omission, etc. However, ...
261
click to vote
NLP
2000
15 years 8 months ago
2000
Abstract. The purpose of this paper is (1) to provide a theoretical justification for the use of Monte-Carlo sampling for approximate resolution of NP-hard maximization problems in...
187
click to vote
TABLEAUX
2000
Springer
15 years 8 months ago
2000
Springer
FaCT (Fast Classification of Terminologies) is a Description Logic (DL) classifier that can also be used for modal logic satisfiability testing. The FaCT system includes two reason...