849 search results - page 4 / 170 » Completely Non-malleable Schemes |
CIKM
2005
Springer
13 years 12 months ago
2005
Springer
The method of assigning labels to the nodes of the XML tree is called a labeling scheme. Based on the labels only, both ordered and un-ordered queries can be processed without acc...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
---------------------------------------------------ABSTRACT-----------------------------------------------In the literature of Round-Robin scheduling scheme, each job is processed,...
HCI
2009
13 years 4 months ago
2009
Abstract. In this paper different interaction schemes which are currently implemented by major automotive manufacturers have been identified and analyzed. Complete overviews on all...
SIGMOD
2005
ACM
14 years 6 months ago
2005
ACM
In data publishing, the owner delegates the role of satisfying user queries to a third-party publisher. As the publisher may be untrusted or susceptible to attacks, it could produ...
ESA
1999
Springer
13 years 10 months ago
1999
Springer
We give a polynomial approximation scheme for the problem of scheduling on uniformly related parallel machines for a large class of objective functions that depend only on the mac...