2392 search results - page 143 / 479 » Matching data dissemination algorithms to application requir... |
189
click to vote
ICDM
2006
IEEE
16 years 16 days ago
2006
IEEE
We propose an algorithm for extracting fields from HTML search results. The output of the algorithm is a database table– a data structure that better lends itself to high-level...
192
click to vote
CGF
2008
15 years 6 months ago
2008
We provide a novel visualization method for the comparison of hierarchically organized data. Our technique visualizes a pair of hierarchies that are to be compared and simultaneou...
430
click to vote
ICA
2012
Springer
14 years 2 months ago
2012
Springer
A novel tensor decomposition called pattern or P-decomposition is proposed to make it possible to identify replicating structures in complex data, such as textures and patterns in ...
180
click to vote
IESS
2007
Springer
16 years 19 days ago
2007
Springer
The stringent performance constraints and short time to market of modern digital systems require automatic methods for design of high performance applicationspecific architectures...
182
click to vote
SODA
2012
ACM
13 years 9 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...