10997 search results - page 19 / 2200 » On the Structure of Complete Sets |
MOBIHOC
2002
ACM
14 years 9 months ago
2002
ACM
We present a series of approximation algorithms for finding a small weakly-connected dominating set (WCDS) in a given graph to be used in clustering mobile ad hoc networks. The st...
PPDP
2009
Springer
14 years 4 months ago
2009
Springer
We propose a novel approach to encapsulate non-deterministic computations in functional logic programs. Our approach is based on set functions that return the set of all the resul...
ICDE
2007
IEEE
14 years 4 months ago
2007
IEEE
User-defined preferences allow personalized ranking of query results. A user provides a declarative specification of his/her preferences, and the system is expected to use that ...
NIPS
2000
13 years 11 months ago
2000
We use graphical models to explore the question of how people learn simple causal relationships from data. The two leading psychological theories can both be seen as estimating th...
CSL
2007
Springer
14 years 4 months ago
2007
Springer
We provide a new correctness criterion for unit-free MLL proof structures and MELL proof structures with units. We prove that deciding the correctness of a MLL and of a MELL proof ...