Sciweavers

4541 search results - page 359 / 909
» Cache-Oblivious Algorithms and Data Structures
Sort
View
ICASSP
2011
IEEE
14 years 8 months ago
Evaluating music sequence models through missing data
Building models of the structure in musical signals raises the question of how to evaluate and compare different modeling approaches. One possibility is to use the model to impute...
Thierry Bertin-Mahieux, Graham Grindlay, Ron J. We...
ALGORITHMICA
2011
14 years 11 months ago
On Bounded Leg Shortest Paths Problems
Let V be a set of points in a d-dimensional lp-metric space. Let s, t ∈ V and let L be any real number. An L-bounded leg path from s to t is an ordered set of points which conne...
Liam Roditty, Michael Segal
158
Voted
ICGI
2010
Springer
15 years 1 months ago
Learning Context Free Grammars with the Syntactic Concept Lattice
The Syntactic Concept Lattice is a residuated lattice based on the distributional structure of a language; the natural representation based on this is a context sensitive formalism...
Alexander Clark
SDM
2011
SIAM
414views Data Mining» more  SDM 2011»
14 years 7 months ago
Clustered low rank approximation of graphs in information science applications
In this paper we present a fast and accurate procedure called clustered low rank matrix approximation for massive graphs. The procedure involves a fast clustering of the graph and...
Berkant Savas, Inderjit S. Dhillon
CRV
2008
IEEE
182views Robotics» more  CRV 2008»
15 years 11 months ago
Deforestation: Extracting 3D Bare-Earth Surface from Airborne LiDAR Data
Bare-earth identification selects points from a LiDAR point cloud so that they can be interpolated to form a representation of the ground surface from which structures, vegetatio...
Wei-Lwun Lu, James J. Little, Alla Sheffer, Hongbo...