Sciweavers

882 search results - page 132 / 177
» On self-embeddings of computable linear orderings
Sort
View
ICDM
2006
IEEE
296views Data Mining» more  ICDM 2006»
15 years 3 months ago
Fast Random Walk with Restart and Its Applications
How closely related are two nodes in a graph? How to compute this score quickly, on huge, disk-resident, real graphs? Random walk with restart (RWR) provides a good relevance scor...
Hanghang Tong, Christos Faloutsos, Jia-Yu Pan
IBPRIA
2003
Springer
15 years 3 months ago
Robust Extraction of Vertices in Range Images by Constraining the Hough Transform
We describe a technique for extracting vertices from range images of cluttered box-like objects. Edge detection is performed and an edge map is acquired. Extraction of vertices is ...
Dimitrios Katsoulas
ITCC
2000
IEEE
15 years 2 months ago
A Unified Derivation of Operational Matrices for Integration in Systems Analysis
Using the operational matrix of an orthogonal function to perform integration for solving, identifying and optimizing a linear dynamic system has several advantages: (1) the metho...
Jiunn-lin Wu, Chin-hsing Chen, Chih-fan Chen
KDD
2004
ACM
179views Data Mining» more  KDD 2004»
15 years 10 months ago
1-dimensional splines as building blocks for improving accuracy of risk outcomes models
Transformation of both the response variable and the predictors is commonly used in fitting regression models. However, these transformation methods do not always provide the maxi...
David S. Vogel, Morgan C. Wang
STOC
1991
ACM
84views Algorithms» more  STOC 1991»
15 years 1 months ago
Self-Testing/Correcting for Polynomials and for Approximate Functions
The study of self-testing/correcting programs was introduced in [8] in order to allow one to use program P to compute function f without trusting that P works correctly. A self-te...
Peter Gemmell, Richard J. Lipton, Ronitt Rubinfeld...