Sciweavers

4541 search results - page 60 / 909
» Cache-Oblivious Algorithms and Data Structures
Sort
View
ICASSP
2011
IEEE
14 years 2 months ago
Weighted and structured sparse total least-squares for perturbed compressive sampling
Solving linear regression problems based on the total least-squares (TLS) criterion has well-documented merits in various applications, where perturbations appear both in the data...
Hao Zhu, Georgios B. Giannakis, Geert Leus
TNN
1998
123views more  TNN 1998»
14 years 10 months ago
A general framework for adaptive processing of data structures
—A structured organization of information is typically required by symbolic processing. On the other hand, most connectionist models assume that data are organized according to r...
Paolo Frasconi, Marco Gori, Alessandro Sperduti
CORR
2010
Springer
193views Education» more  CORR 2010»
14 years 9 months ago
A Probabilistic Approach for Learning Folksonomies from Structured Data
Learning structured representations has emerged as an important problem in many domains, including document and Web data mining, bioinformatics, and image analysis. One approach t...
Anon Plangprasopchok, Kristina Lerman, Lise Getoor
SODA
1997
ACM
144views Algorithms» more  SODA 1997»
15 years 13 days ago
Methods for Achieving Fast Query Times in Point Location Data Structures
Given a collection S of n line segments in the plane, the planar point location problem is to construct a data structure that can e ciently determine for a given query point p the...
Michael T. Goodrich, Mark W. Orletsky, Kumar Ramai...
KBSE
2007
IEEE
15 years 5 months ago
Assertion-based repair of complex data structures
Programmers have long used assertions to characterize properties of code. An assertion violation signals a corruption in the program state. At such a state, it is standard to term...
Bassem Elkarablieh, Ivan Garcia, Yuk Lai Suen, Sar...