Sciweavers

552 search results - page 99 / 111
» On the Complexity of Join Predicates
Sort
View
SDM
2003
SIAM
123views Data Mining» more  SDM 2003»
13 years 9 months ago
Fast Online SVD Revisions for Lightweight Recommender Systems
The singular value decomposition (SVD) is fundamental to many data modeling/mining algorithms, but SVD algorithms typically have quadratic complexity and require random access to ...
Matthew Brand
BMCBI
2010
103views more  BMCBI 2010»
13 years 7 months ago
A method of predicting changes in human gene splicing induced by genetic variants in context of cis-acting elements
Background: Polymorphic variants and mutations disrupting canonical splicing isoforms are among the leading causes of human hereditary disorders. While there is a substantial evid...
Alexander G. Churbanov, Igor Vorechovsky, Chindo H...
CGF
2002
184views more  CGF 2002»
13 years 7 months ago
The 3D Model Acquisition Pipeline
Three-dimensional (3D) image acquisition systems are rapidly becoming more affordable, especially systems based on commodity electronic cameras. At the same time, personal compute...
Fausto Bernardini, Holly E. Rushmeier
CSUR
1999
159views more  CSUR 1999»
13 years 7 months ago
Hubs, authorities, and communities
The Web can be naturally modeled as a directed graph, consisting of a set of abstract nodes (the pages) joined by directional edges (the hyperlinks). Hyperlinks encode a considerab...
Jon M. Kleinberg
IJCV
2010
194views more  IJCV 2010»
13 years 6 months ago
Extended Phase Field Higher-Order Active Contour Models for Networks - Its Application to Road Network Extraction from VHR Satel
This paper addresses the segmentation from an image of entities that have the form of a ‘network’, i.e. the region in the image corresponding to the entity is composed of bran...
Ting Peng, Ian H. Jermyn, Véronique Prinet,...