Sciweavers

5046 search results - page 961 / 1010
» Non-redundant data clustering
Sort
View
ICDE
2009
IEEE
177views Database» more  ICDE 2009»
14 years 10 months ago
Light-Weight, Runtime Verification of Query Sources
Modern database systems increasingly make use of networked storage. This storage can be in the form of SAN's or in the form of shared-nothing nodes in a cluster. One type of a...
Tingjian Ge, Stanley B. Zdonik
ICDE
2005
IEEE
122views Database» more  ICDE 2005»
14 years 9 months ago
Uncovering Database Access Optimizations in the Middle Tier with TORPEDO
A popular architecture for enterprise applications is one of a stateless object-based server accessing persistent data through Object-Relational mapping software. The reported ben...
Bruce E. Martin
ICDE
1998
IEEE
83views Database» more  ICDE 1998»
14 years 9 months ago
Grouping Techniques for Update Propagation in Intermittently Connected Databases
We consider an environment where one or more servers carry databases that are of interest to a community of clients. The clients are only intermittently connected to the server fo...
Sameer Mahajan, Michael J. Donahoo, Shamkant B. Na...
ISBI
2008
IEEE
14 years 9 months ago
Controlling the error in FMRI: Hypothesis testing or set estimation?
This paper describes a new methodology and associated theoretical analysis for rapid and accurate extraction of activation regions from functional MRI data. Most fMRI data analysi...
Aarti Singh, Rebecca Willett, Robert Nowak, Zachar...
WWW
2009
ACM
14 years 8 months ago
An axiomatic approach for result diversification
Understanding user intent is key to designing an effective ranking system in a search engine. In the absence of any explicit knowledge of user intent, search engines want to diver...
Sreenivas Gollapudi, Aneesh Sharma