Sciweavers

8437 search results - page 1319 / 1688
» Preferences over Sets
Sort
View
CPC
2004
98views more  CPC 2004»
15 years 6 months ago
And/Or Trees Revisited
We consider boolean functions over n variables. Any such function can be represented (and computed) by a complete binary tree with and or or in the internal nodes and a literal in...
Brigitte Chauvin, Philippe Flajolet, Danièl...
CPC
2004
69views more  CPC 2004»
15 years 6 months ago
New Bounds on Parent-Identifying Codes: The Case of Multiple Parents
Let C be a code of length n over an alphabet of q letters. A codeword y is called a descendant of a set of t codewords {x1 , . . . , xt } if yi {x1 i , . . . , xt i} for all i = ...
Noga Alon, Uri Stav
AI
2000
Springer
15 years 6 months ago
Credal networks
Credal networks are models that extend Bayesian nets to deal with imprecision in probability, and can actually be regarded as sets of Bayesian nets. Evidence suggests that credal ...
Fabio Gagliardi Cozman
CGF
2002
187views more  CGF 2002»
15 years 6 months ago
Stylizing Silhouettes at Interactive Rates: From Silhouette Edges to Silhouette Strokes
A way to create effective stylized line drawings is to draw strokes that start and stop at visible portions along the silhouette of an object to be portrayed. In computer graphics...
Tobias Isenberg, Nick Halper, Thomas Strothotte
CLUSTER
2002
IEEE
15 years 6 months ago
ZENTURIO: An Experiment Management System for Cluster and Grid Computing
The need to conduct and manage large sets of experiments for scientific applications dramatically increased over the last decade. However, there is still very little tool support ...
Radu Prodan, Thomas Fahringer
« Prev « First page 1319 / 1688 Last » Next »