136 search results - page 23 / 28 » A Polynomial-Time Algorithm for Global Value Numbering |
116
click to vote
TKDE
2012
13 years 1 days ago
2012
—Moving Object Databases (MOD), although ubiquitous, still call for methods that will be able to understand, search, analyze, and browse their spatiotemporal content. In this pap...
BMCBI
2010
14 years 9 months ago
2010
Background: Principal component analysis (PCA) has gained popularity as a method for the analysis of highdimensional genomic data. However, it is often difficult to interpret the ...
ASPDAC
2005
ACM
15 years 3 months ago
2005
ACM
Abstract— The success of classical high level synthesis has been limited by the complexity of the applications it can handle, typically not large enough to necessitate the depart...
ICDE
2010
IEEE
14 years 7 months ago
2010
IEEE
In this paper, we propose the Hybrid-Layer Index (simply, the HL-index) that is designed to answer top-k queries efficiently when the queries are expressed on any arbitrary subset ...
ADBIS
2003
Springer
15 years 2 months ago
2003
Springer
Let a tuple of n objects obeying a query graph (QG) be called the n-tuple. The “Ddistance-value” of this n-tuple is the value of a linear function of distances of the n objects...