8810 search results - page 471 / 1762 » Openness |
208
click to vote
SCN
2010
Springer
15 years 1 months ago
2010
Springer
In this paper we examine issues of trust and reputation in Mobile Ad hoc Networks. We look at a number of the trust and reputation models that have been proposed and we highlight o...
211
click to vote
SIAMCOMP
2010
15 years 1 months ago
2010
We show that Edge Dominating Set, Hamiltonian Cycle, and Graph Coloring are W[1]-hard parameterized by clique-width. It was an open problem, explicitly mentioned in several papers,...
220
Voted
DLOG
2011
14 years 10 months ago
2011
We prove co-N2ExpTime-hardness for conjunctive query entailment in the description logic ALCOIF , thus improving the previously known 2ExpTime lower bound. The result transfers to ...
221
click to vote
ISMM
2011
Springer
14 years 9 months ago
2011
Springer
Abstract. In this paper we present a parallel algorithm for the topological watershed, suitable for a shared memory parallel architecture. On a 24-core machine an average speed-up ...
192
click to vote
CVPR
2004
IEEE
16 years 8 months ago
2004
IEEE
We present a novel approach for estimating light sources from a single image of a scene that is illuminated by major near point light sources, a few directional light sources and ...