1461 search results - page 182 / 293 » Complexity of Graph Covering Problems |
ASIACRYPT
2010
Springer
13 years 7 months ago
2010
Springer
We consider the problem of encrypting structured data (e.g., a web graph or a social network) in such a way that it can be efficiently and privately queried. For this purpose, we ...
COMPGEOM
1994
ACM
14 years 1 months ago
1994
ACM
Ray (segment) shooting is the problem of determining the first intersection between a ray (directed line segment) and a collection of polygonal or polyhedral obstacles. In order t...
CERA
2002
13 years 8 months ago
2002
: Many industries are shifting from mass production to mass customization, which demands quick response to the needs of individual customers with high quality and low costs. The de...
TASE
2010
IEEE
13 years 3 months ago
2010
IEEE
This paper focuses on the assignment of discrete points among K robots and determining the order in which the points should be processed by the robots, in the presence of geometric...
BMCBI
2008
13 years 9 months ago
2008
Background: Automated extraction of protein-protein interactions (PPI) is an important and widely studied task in biomedical text mining. We propose a graph kernel based approach ...