9730 search results - page 104 / 1946 » Relating models of backtracking |
123
Voted
WWW
2008
ACM
16 years 4 months ago
2008
ACM
This paper proposes an approach for solving the problem of composite process oriented service discovery with preserving business and timed relation. Key to our approach is the def...
143
Voted
SSDBM
2003
IEEE
15 years 8 months ago
2003
IEEE
Relational index structures, as for instance the Relational Interval Tree, the Relational R-Tree, or the Linear Quadtree, support efficient processing of queries on top of existin...
143
Voted
GEOINFO
2003
15 years 4 months ago
2003
Relational index structures, as for instance the Relational Interval Tree, the Relational R-Tree, or the Linear Quadtree, support efficient processing of queries on top of existing...
141
Voted
WWW
2010
ACM
15 years 10 months ago
2010
ACM
Relational databases hold a vast quantity of information and making them accessible to the web is an big challenge. There is a need to make these databases accessible with as litt...
132
Voted
CRYPTO
2010
Springer
15 years 4 months ago
2010
Springer
This paper presents a fully secure functional encryption scheme for a wide class of relations, that are specified by non-monotone access structures combined with inner-product rel...