Sciweavers

1076 search results - page 104 / 216
» Operations on proofs and labels
Sort
View
JCP
2006
102views more  JCP 2006»
13 years 10 months ago
General Methodology for Analysis and Modeling of Trust Relationships in Distributed Computing
In this paper, we discuss a general methodology for analysis and modeling of trust relationships in distributed computing. We discuss the classification of trust relationships, cat...
Weiliang Zhao, Vijay Varadharajan, George Bryan
IPMU
2010
Springer
13 years 8 months ago
Retrieving Texture Images Using Coarseness Fuzzy Partitions
Abstract. In this paper, a Fuzzy Dominant Texture Descriptor is proposed for semantically describing an image. This fuzzy descriptor is defined over a set of fuzzy sets modelling ...
Jesús Chamorro-Martínez, Pedro Manue...
TIP
2010
155views more  TIP 2010»
13 years 8 months ago
Laplacian Regularized D-Optimal Design for Active Learning and Its Application to Image Retrieval
—In increasingly many cases of interest in computer vision and pattern recognition, one is often confronted with the situation where data size is very large. Usually, the labels ...
Xiaofei He
POPL
2008
ACM
14 years 10 months ago
Proving non-termination
The search for proof and the search for counterexamples (bugs) are complementary activities that need to be pursued concurrently in order to maximize the practical success rate of...
Ashutosh Gupta, Thomas A. Henzinger, Rupak Majumda...
PPOPP
2010
ACM
14 years 7 months ago
Featherweight X10: a core calculus for async-finish parallelism
We present a core calculus with two of X10's key constructs for parallelism, namely async and finish. Our calculus forms a convenient basis for type systems and static analys...
Jonathan K. Lee, Jens Palsberg