Sciweavers

9290 search results - page 1577 / 1858
» The Predictability of Data Values
Sort
View
POPL
2003
ACM
16 years 5 months ago
Discovering affine equalities using random interpretation
We present a new polynomial-time randomized algorithm for discovering affine equalities involving variables in a program. The key idea of the algorithm is to execute a code fragme...
Sumit Gulwani, George C. Necula
SIGMOD
2004
ACM
184views Database» more  SIGMOD 2004»
16 years 5 months ago
CORDS: Automatic Discovery of Correlations and Soft Functional Dependencies
The rich dependency structure found in the columns of real-world relational databases can be exploited to great advantage, but can also cause query optimizers--which usually assum...
Ihab F. Ilyas, Volker Markl, Peter J. Haas, Paul B...
ICFP
2003
ACM
16 years 4 months ago
FreshML: programming with binders made simple
FreshML extends ML with elegant and practical constructs for declaring and manipulating syntactical data involving statically scoped binding operations. User-declared FreshML data...
Mark R. Shinwell, Andrew M. Pitts, Murdoch Gabbay
ICCD
2006
IEEE
113views Hardware» more  ICCD 2006»
16 years 1 months ago
A theory of Error-Rate Testing
— We have entered an era where chip yields are decreasing with scaling. A new concept called intelligible testing has been previously proposed with the goal of reversing this tre...
Shideh Shahidi, Sandeep Gupta
ICDE
2010
IEEE
399views Database» more  ICDE 2010»
15 years 11 months ago
Discovery-driven graph summarization
Abstract— Large graph datasets are ubiquitous in many domains, including social networking and biology. Graph summarization techniques are crucial in such domains as they can ass...
Ning Zhang, Yuanyuan Tian, Jignesh M. Patel
« Prev « First page 1577 / 1858 Last » Next »