Sciweavers

1732 search results - page 173 / 347
» Sequences of Level 1, 2, 3, ..., k , ..
Sort
View
JEA
2006
83views more  JEA 2006»
15 years 6 months ago
Cache-Friendly implementations of transitive closure
In this paper we show cache-friendly implementations of the Floyd-Warshall algorithm for the All-Pairs ShortestPath problem. We first compare the best commercial compiler optimiza...
Michael Penner, Viktor K. Prasanna
3DIM
2007
IEEE
16 years 26 days ago
Predetermination of ICP Registration Errors And Its Application to View Planning
We present an analytical method to estimate the absolute registration error bounds if two surfaces were to be aligned using the ICP (Iterative Closest Point) algorithm. The estima...
Kok-Lim Low, Anselmo Lastra
ICAI
2008
15 years 8 months ago
Nonrestrictive Concept-Acquisition by Representational Redescription
coarse procedures or very abstract frames from the point of view of algorithm, because some crucial issues like the representation, evolution, storage, and learning process of conc...
Hui Wei, Yan Chen
CVPR
2009
IEEE
17 years 1 months ago
Efficient Scale Space Auto-Context for Image Segmentation and Labeling
The Conditional Random Fields (CRF) model, using patch-based classification bound with context information, has recently been widely adopted for image segmentation/ labeling. In...
Jiayan Jiang (UCLA), Zhuowen Tu (UCLA)
STACS
2000
Springer
15 years 10 months ago
The Complexity of Poor Man's Logic
Motivated by description logics, we investigate what happens to the complexity of modal satisfiability problems if we only allow formulas built from literals, , 3, and 2. Previous...
Edith Hemaspaandra