Sciweavers

2479 search results - page 110 / 496
» A Computational Theory of Working Memory
Sort
View
SIGMOD
2007
ACM
224views Database» more  SIGMOD 2007»
14 years 8 months ago
Design of flash-based DBMS: an in-page logging approach
The popularity of high-density flash memory as data storage media has increased steadily for a wide spectrum of computing devices such as PDA's, MP3 players, mobile phones an...
Sang-Won Lee, Bongki Moon
PODS
2012
ACM
240views Database» more  PODS 2012»
11 years 10 months ago
Approximate computation and implicit regularization for very large-scale data analysis
Database theory and database practice are typically the domain of computer scientists who adopt what may be termed an algorithmic perspective on their data. This perspective is ve...
Michael W. Mahoney
AAAI
2006
13 years 9 months ago
Computing Slater Rankings Using Similarities among Candidates
Voting (or rank aggregation) is a general method for aggregating the preferences of multiple agents. One important voting rule is the Slater rule. It selects a ranking of the alte...
Vincent Conitzer
HICSS
2005
IEEE
153views Biometrics» more  HICSS 2005»
14 years 1 months ago
Developing a Knowledge-Based Organizational Performance Model for Discontinuous Participatory Enterprises
Our research seeks to understand how to extend established organization theory and emerging knowledgeflow theory to inform the design of organizations with discontinuous participa...
Rahinah Ibrahim, Mark E. Nissen
EUROPAR
2010
Springer
13 years 8 months ago
Optimized On-Chip-Pipelined Mergesort on the Cell/B.E
Abstract. Limited bandwidth to off-chip main memory is a performance bottleneck in chip multiprocessors for streaming computations, such as Cell/B.E., and this will become even mor...
Rikard Hultén, Christoph W. Kessler, Jö...