125 search results - page 8 / 25 » Parameterized XPath Views |
ACIVS
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Using cylindrical parameterization, the 3D mesh surface extracted from colon CT scan images is parameterized onto a cylinder, and afterwards visualized with a modified C...
CATS
2008
13 years 9 months ago
2008
The problem of deciding whether the edge-set of a given graph can be partitioned into at most k cliques is well known to be NP-complete. In this paper we investigate this problem ...
FAW
2008
Springer
13 years 9 months ago
2008
Springer
We study the parameterized complexity of an NP-complete geometric covering problem called d-dimensional Rectangle Stabbing where we are given a set of axis-parallel d-dimensional h...
IWOCA
2010
Springer
13 years 2 months ago
2010
Springer
The maximum independent set problem is NP-complete for graphs in general, but becomes solvable in polynomial time when restricted to graphs in many special classes. The problem is ...
CIKM
2005
Springer
14 years 1 months ago
2005
Springer
We introduce the notion of views as a mechanism for securing and providing access control in the context of XML. Research in XML has explored several efficient querying mechanism...