Sciweavers

1213 search results - page 236 / 243
» Approximation in quantale-enriched categories
Sort
View
ICCAD
2009
IEEE
159views Hardware» more  ICCAD 2009»
14 years 7 months ago
First steps towards SAT-based formal analog verification
Boolean satisfiability (SAT) based methods have traditionally been popular for formally verifying properties for digital circuits. We present a novel methodology for formulating a...
Saurabh K. Tiwary, Anubhav Gupta, Joel R. Phillips...
BCB
2010
140views Bioinformatics» more  BCB 2010»
14 years 4 months ago
Guiding belief propagation using domain knowledge for protein-structure determination
A major bottleneck in high-throughput protein crystallography is producing protein-structure models from an electrondensity map. In previous work, we developed Acmi, a probabilist...
Ameet Soni, Craig A. Bingman, Jude W. Shavlik
CORR
2010
Springer
139views Education» more  CORR 2010»
14 years 4 months ago
Data Cleaning and Query Answering with Matching Dependencies and Matching Functions
Matching dependencies were recently introduced as declarative rules for data cleaning and entity resolution. Enforcing a matching dependency on a database instance identifies the ...
Leopoldo E. Bertossi, Solmaz Kolahi, Laks V. S. La...
WWW
2011
ACM
14 years 4 months ago
Parallel boosted regression trees for web search ranking
Gradient Boosted Regression Trees (GBRT) are the current state-of-the-art learning paradigm for machine learned websearch ranking — a domain notorious for very large data sets. ...
Stephen Tyree, Kilian Q. Weinberger, Kunal Agrawal...
WWW
2011
ACM
14 years 4 months ago
Limiting the spread of misinformation in social networks
In this work, we study the notion of competing campaigns in a social network. By modeling the spread of influence in the presence of competing campaigns, we provide necessary too...
Ceren Budak, Divyakant Agrawal, Amr El Abbadi