Sciweavers

4854 search results - page 897 / 971
» It's the Programming, Stupid
Sort
View
ICALP
2009
Springer
15 years 10 months ago
Dynamic Succinct Ordered Trees
Abstract. We study the problem of maintaining a dynamic tree succinctly, in 2n + o(n) bits, under updates of the following form: insertion or deletion of a leaf, insertion of a nod...
Arash Farzan, J. Ian Munro
ICALP
2009
Springer
15 years 10 months ago
Correlation Clustering Revisited: The "True" Cost of Error Minimization Problems
Correlation Clustering was defined by Bansal, Blum, and Chawla as the problem of clustering a set of elements based on a possibly inconsistent binary similarity function between e...
Nir Ailon, Edo Liberty
ICALP
2009
Springer
15 years 10 months ago
Secure Function Collection with Sublinear Storage
Consider a center possessing a trusted (tamper proof) device that wishes to securely compute a public function over private inputs that are contributed by some network nodes. In ne...
Maged H. Ibrahim, Aggelos Kiayias, Moti Yung, Hong...
SIGMOD
2009
ACM
137views Database» more  SIGMOD 2009»
15 years 10 months ago
Advances in flash memory SSD technology for enterprise database applications
The past few decades have witnessed a chronic and widening imbalance among processor bandwidth, disk capacity, and access speed of disk. According to Amdhal's law, the perfor...
Sang-Won Lee, Bongki Moon, Chanik Park
SIGMOD
2008
ACM
145views Database» more  SIGMOD 2008»
15 years 10 months ago
The Claremont report on database research
In late May, 2008, a group of database researchers, architects, users and pundits met at the Claremont Resort in Berkeley, California to discuss the state of the research field an...
Rakesh Agrawal, Anastasia Ailamaki, Philip A. Bern...