Sciweavers

530 search results - page 73 / 106
» An Algorithm for Approximating the Satisfiability Problem of...
Sort
View
ICCAD
2009
IEEE
159views Hardware» more  ICCAD 2009»
13 years 5 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...
KDD
2009
ACM
190views Data Mining» more  KDD 2009»
14 years 8 months ago
Efficient influence maximization in social networks
Influence maximization is the problem of finding a small subset of nodes (seed nodes) in a social network that could maximize the spread of influence. In this paper, we study the ...
Wei Chen, Yajun Wang, Siyu Yang
NIPS
2003
13 years 9 months ago
Self-calibrating Probability Forecasting
In the problem of probability forecasting the learner’s goal is to output, given a training set and a new object, a suitable probability measure on the possible values of the ne...
Vladimir Vovk, Glenn Shafer, Ilia Nouretdinov
HICSS
2003
IEEE
93views Biometrics» more  HICSS 2003»
14 years 1 months ago
A General Method for Statistical Performance Evaluation
In the paper, we propose a general method for statistical performance evaluation. The method incorporates various statistical metrics and automatically selects an appropriate stat...
Longzhuang Li, Yi Shang, Wei Zhang, Hongchi Shi
CORR
2011
Springer
145views Education» more  CORR 2011»
13 years 2 months ago
Global Search Based on Efficient Diagonal Partitions and a set of Lipschitz Constants
In the paper, the global optimization problem of a multidimensional “black-box” function satisfying the Lipschitz condition over a hyperinterval with an unknown Lipschitz const...
Yaroslav D. Sergeyev, Dmitri E. Kvasov