Sciweavers

1083 search results - page 174 / 217
» Efficient Discovery of Confounders in Large Data Sets
Sort
View
ICDE
2007
IEEE
145views Database» more  ICDE 2007»
14 years 10 months ago
Fast Identification of Relational Constraint Violations
Logical constraints, (e.g., 'phone numbers in toronto can have prefixes 416, 647, 905 only'), are ubiquitous in relational databases. Traditional integrity constraints, ...
Amit Chandel, Nick Koudas, Ken Q. Pu, Divesh Sriva...
VLDB
2000
ACM
229views Database» more  VLDB 2000»
14 years 14 days ago
Local Dimensionality Reduction: A New Approach to Indexing High Dimensional Spaces
Many emerging application domains require database systems to support efficient access over highly multidimensional datasets. The current state-of-the-art technique to indexing hi...
Kaushik Chakrabarti, Sharad Mehrotra
COMPGEOM
2006
ACM
14 years 19 days ago
I/O-efficient batched union-find and its applications to terrain analysis
Despite extensive study over the last four decades and numerous applications, no I/O-efficient algorithm is known for the union-find problem. In this paper we present an I/O-effic...
Pankaj K. Agarwal, Lars Arge, Ke Yi
BMCBI
2010
146views more  BMCBI 2010»
13 years 9 months ago
On the Choice and Number of Microarrays for Transcriptional Regulatory Network Inference
Background: Transcriptional regulatory network inference (TRNI) from large compendia of DNA microarrays has become a fundamental approach for discovering transcription factor (TF)...
Elissa J. Cosgrove, Timothy S. Gardner, Eric D. Ko...
JCS
2010
104views more  JCS 2010»
13 years 7 months ago
Finding the PKI needles in the Internet haystack
Public-key cryptography can uniquely enable trust within distributed settings. Employing it usually requires deploying a set of tools and services collectively known as a public k...
Massimiliano Pala, Sean W. Smith