Sciweavers

882 search results - page 56 / 177
» On self-embeddings of computable linear orderings
Sort
View
ICCAD
2007
IEEE
161views Hardware» more  ICCAD 2007»
15 years 6 months ago
Clustering based pruning for statistical criticality computation under process variations
— We present a new linear time technique to compute criticality information in a timing graph by dividing it into “zones”. Errors in using tightness probabilities for critica...
Hushrav Mogal, Haifeng Qian, Sachin S. Sapatnekar,...
ECWEB
2009
Springer
204views ECommerce» more  ECWEB 2009»
15 years 4 months ago
Computational Complexity Reduction for Factorization-Based Collaborative Filtering Algorithms
Abstract. Alternating least squares (ALS) is a powerful matrix factorization (MF) algorithm for both implicit and explicit feedback based recommender systems. We show that by using...
István Pilászy, Domonkos Tikk
ICFEM
2005
Springer
15 years 3 months ago
Using Three-Valued Logic to Specify and Verify Algorithms of Computational Geometry
Many safety-critical systems deal with geometric objects. Reasoning about the correctness of such systems is mandatory and requires the use of basic definitions of geometry for th...
Jens Brandt, Klaus Schneider
CIVR
2007
Springer
173views Image Analysis» more  CIVR 2007»
15 years 4 months ago
Fast and cheap object recognition by linear combination of views
In this paper, we present a real-time algorithm for 3D object detection in images. Our method relies on the Ullman and Basri [13] theory which claims that the same object under di...
Jérome Revaud, Guillaume Lavoué, Yas...
WEA
2009
Springer
126views Algorithms» more  WEA 2009»
15 years 4 months ago
Computing Elevation Maxima by Searching the Gauss Sphere
The elevation function on a smoothly embedded 2-manifold in R3 reflects the multiscale topography of cavities and protrusions as local maxima. The function has been useful in iden...
Bei Wang, Herbert Edelsbrunner, Dmitriy Morozov