Sciweavers

2517 search results - page 112 / 504
» Specifying Weak Sets
Sort
View
PR
2006
101views more  PR 2006»
15 years 5 months ago
Feature-based approach to semi-supervised similarity learning
For the management of digital document collections, automatic database analysis still has ties to deal with semantic queries and abstract concepts that users are looking for. When...
Philippe Henri Gosselin, Matthieu Cord
APAL
2005
154views more  APAL 2005»
15 years 5 months ago
A Sahlqvist theorem for distributive modal logic
In this paper we consider distributive modal logic, a setting in which we may add modalities, such as classical types of modalities as well as weak forms of negation, to the fragm...
Mai Gehrke, Hideo Nagahashi, Yde Venema
FSS
2010
111views more  FSS 2010»
15 years 4 months ago
The geometry of consonant belief functions: Simplicial complexes of necessity measures
In this paper we extend the geometric approach to the theory of evidence in order to include the class of necessity measures, represented on a finite domain of “frame” by con...
Fabio Cuzzolin
TCS
2011
15 years 12 days ago
Limitations of self-assembly at temperature 1
We prove that if a set X ⊆ Z2 weakly self-assembles at temperature 1 in a deterministic (Winfree) tile assembly system satisfying a natural condition known as pumpability, then ...
David Doty, Matthew J. Patitz, Scott M. Summers
JMLR
2010
149views more  JMLR 2010»
15 years 7 days ago
Fast Committee-Based Structure Learning
Current methods for causal structure learning tend to be computationally intensive or intractable for large datasets. Some recent approaches have speeded up the process by first m...
Ernest Mwebaze, John A. Quinn