Sciweavers

860 search results - page 97 / 172
» Podcasting made simple
Sort
View
KDD
2008
ACM
138views Data Mining» more  KDD 2008»
16 years 6 months ago
Quantitative evaluation of approximate frequent pattern mining algorithms
Traditional association mining algorithms use a strict definition of support that requires every item in a frequent itemset to occur in each supporting transaction. In real-life d...
Rohit Gupta, Gang Fang, Blayne Field, Michael Stei...
ICALP
2009
Springer
16 years 6 months ago
Sorting and Selection with Imprecise Comparisons
Abstract. In experimental psychology, the method of paired comparisons was proposed as a means for ranking preferences amongst n elements of a human subject. The method requires pe...
Avinatan Hassidim, Jelani Nelson, Miklós Aj...
164
Voted
IEEEPACT
2009
IEEE
16 years 23 days ago
Soft-OLP: Improving Hardware Cache Performance through Software-Controlled Object-Level Partitioning
—Performance degradation of memory-intensive programs caused by the LRU policy’s inability to handle weaklocality data accesses in the last level cache is increasingly serious ...
Qingda Lu, Jiang Lin, Xiaoning Ding, Zhao Zhang, X...
ISPASS
2007
IEEE
16 years 12 days ago
A Comparison of Two Approaches to Parallel Simulation of Multiprocessors
— The design trend towards CMPs has made the simulation of multiprocessor systems a necessity and has also made multiprocessor systems widely available. While a serial multiproce...
Andrew Over, Bill Clarke, Peter E. Strazdins
190
Voted
GECCO
2007
Springer
241views Optimization» more  GECCO 2007»
16 years 8 days ago
Binary ant algorithm
When facing dynamic optimization problems the goal is no longer to find the extrema, but to track their progression through the space as closely as possible. Over these kind of ov...
Carlos Fernandes, Agostinho C. Rosa, Vitorino Ramo...