6300 search results - page 92 / 1260 » We have it easy, but do we have it right |
117
click to vote
SIGGRAPH
1999
ACM
15 years 5 months ago
1999
ACM
This paper presents a novel 3D plenoptic function, which we call concentric mosaics. We constrain camera motion to planar concentric circles, and create concentric mosaics using a...
ATAL
2003
Springer
15 years 6 months ago
2003
Springer
A collective obligation is an obligation directed to a group of agents so that the group, as a whole, is obliged to achieve a given task. The problem investigated here is the impac...
120
click to vote
WWW
2004
ACM
16 years 1 months ago
2004
ACM
To be able to realize the vision of the semantic web an important bottleneck that needs to be solved is an easy and intuitive approach for the annotation of websites with semantic...
179
click to vote
SIGMOD
2005
ACM
16 years 1 months ago
2005
ACM
We review the notion of hypertree width, a measure of the degree of cyclicity of hypergraphs that is useful for identifying and solving efficiently easy instances of hard problems...
108
click to vote
COCO
2009
Springer
15 years 7 months ago
2009
Springer
—The Berman-Hartmanis conjecture states that all NP-complete sets are P-isomorphic each other. On this conjecture, we first improve the result of [3] and show that all NP-comple...