5523 search results - page 378 / 1105 » Improving application performance with hardware data structu... |
153
click to vote
DAC
2003
ACM
16 years 7 months ago
2003
ACM
The classic algorithm for optimal buffer insertion due to van Ginneken has time and space complexity O(n2 ), where n is the number of possible buffer positions. We present a new a...
172
click to vote
VLDB
1999
ACM
15 years 10 months ago
1999
ACM
On-Line Analytical Processing (OLAP) based on a dimensional view of data is being used increasingly for the purpose of analyzing very large amounts of data. To improve query perfo...
173
Voted
CIKM
2008
Springer
15 years 8 months ago
2008
Springer
We propose a dynamic faceted search system for discoverydriven analysis on data with both textual content and structured attributes. From a keyword query, we want to dynamically s...
173
click to vote
ICDAR
2009
IEEE
15 years 3 months ago
2009
IEEE
Combining classifier methods have shown their effectiveness in a number of applications. Nonetheless, using simultaneously multiple classifiers may result in some cases in a reduc...
182
click to vote
CORR
2012
Springer
14 years 1 months ago
2012
Springer
Graphs are fundamental data structures and have been employed for centuries to model real-world systems and phenomena. Random walk with restart (RWR) provides a good proximity sco...