4541 search results - page 198 / 909 » Cache-Oblivious Algorithms and Data Structures |
143
click to vote
ICCV
2009
IEEE
15 years 1 months ago
2009
IEEE
This paper investigates a new learning formulation called dynamic group sparsity. It is a natural extension of the standard sparsity concept in compressive sensing, and is motivat...
115
click to vote
EDBT
2009
ACM
15 years 10 months ago
2009
ACM
The largeness and the heterogeneity of most graph-modeled datasets in several database application areas make the query process a real challenge because of the lack of a complete ...
142
click to vote
WEBDB
2007
Springer
15 years 9 months ago
2007
Springer
Open Information Extraction (OIE) is a recently-introduced type of information extraction that extracts small individual pieces of data from input text without any domainspecific...
107
click to vote
SAS
1999
Springer
15 years 7 months ago
1999
Springer
This paper describes a powerful method for dead code analysis and elimination in the presence of recursive data constructions. We describe partially dead recursive data using live...
135
click to vote
SODA
2012
ACM
13 years 5 months ago
2012
ACM
We describe a data structure for submatrix maximum queries in Monge matrices or Monge partial matrices, where a query specifies a contiguous submatrix of the given matrix, and it...