Sciweavers

11718 search results - page 1913 / 2344
» Testing database applications
Sort
View
SODA
2010
ACM
196views Algorithms» more  SODA 2010»
16 years 4 months ago
Deletion Without Rebalancing in Balanced Binary Trees
We address the vexing issue of deletions in balanced trees. Rebalancing after a deletion is generally more complicated than rebalancing after an insertion. Textbooks neglect delet...
Siddhartha Sen, Robert E. Tarjan
176
Voted
MICCAI
2009
Springer
16 years 4 months ago
Constrained Data Decomposition and Regression for Analyzing Healthy Aging from Fiber Tract Diffusion Properties
Abstract. It has been shown that brain structures in normal aging undergo significant changes attributed to neurodevelopmental and neurodegeneration processes as a lifelong, dynami...
Sylvain Gouttard, Marcel Prastawa, Elizabeth Bulli...
188
Voted
ICDE
2010
IEEE
250views Database» more  ICDE 2010»
16 years 4 months ago
Optimized Query Evaluation Using Cooperative Sorts
— Many applications require sorting a table over multiple sort orders: generation of multiple reports from a table, evaluation of a complex query that involves multiple instances...
Yu Cao, Ramadhana Bramandia, Chee-Yong Chan, Kian-...
ICWS
2009
IEEE
16 years 4 months ago
Distributed Cross-Domain Change Management
Distributed systems increasingly span organizational boundaries and, with this, system and service management domains. Web services are the primary means of exposing services to c...
Bruno Wassermann, Heiko Ludwig, Jim Laredo, Kamal ...
SOSP
2001
ACM
16 years 3 months ago
Anticipatory scheduling: A disk scheduling framework to overcome deceptive idleness in synchronous I/O
Disk schedulers in current operating systems are generally work-conserving, i.e., they schedule a request as soon as the previous request has finished. Such schedulers often requ...
Sitaram Iyer, Peter Druschel
« Prev « First page 1913 / 2344 Last » Next »