Sciweavers

1941 search results - page 170 / 389
» On the Hardness of Approximate Reasoning
Sort
View
JSAT
2006
83views more  JSAT 2006»
15 years 6 months ago
Report of the Third QBF Solvers Evaluation
This paper reports about the 2005 comparative evaluation of solvers for quantified Boolean formulas (QBFs), the third in a series of non-competitive events established with the ai...
Massimo Narizzano, Luca Pulina, Armando Tacchella
TRIDENTCOM
2010
IEEE
15 years 4 months ago
Experimentally-Driven Research in Publish/Subscribe Information-Centric Inter-Networking
Testing and evaluating new architectural propositions is a challenge. Given the usual variety of technologies and scales involved in the necessary evaluation, a one-size-fits-all a...
András Zahemszky, Borislava Gajic, Christia...

Publication
281views
17 years 6 months ago
Modeling Image Textures by Gibbs Random Fields
Drawbacks of the traditional scenario of image modeling by Gibbs random fields with multiple pairwise pixel interactions are outlined, and a more reasonable alternative scenario b...
Georgy Gimel'farb
ICC
2007
IEEE
16 years 26 days ago
New UWB Receiver Designs Based on a Gaussian-Laplacian Noise-Plus-MAI Model
—Two novel receiver structures which surpass the performance of the conventional matched filter receiver are proposed for ultra-wide bandwidth multiple access communications. Th...
Norman C. Beaulieu, Somasundaram Niranjayan
COMPGEOM
2006
ACM
16 years 15 days ago
An upper bound on the average size of silhouettes
It is a widely observed phenomenon in computer graphics that the size of the silhouette of a polyhedron is much smaller than the size of the whole polyhedron. This paper provides,...
Marc Glisse