Sciweavers

1663 search results - page 254 / 333
» Compositional Service Trees
Sort
View
PKC
2000
Springer
120views Cryptology» more  PKC 2000»
14 years 1 months ago
Optimally Efficient Accountable Time-Stamping
Abstract. Efficient secure time-stamping schemes employ a 2-level approach in which the time-stamping service operates in rounds. We say that a time-stamping service is accountable...
Ahto Buldas, Helger Lipmaa, Berry Schoenmakers
MSV
2007
13 years 11 months ago
FMC-QE: A New Approach in Quantitative Modeling
Abstract—Service requests are the origin of every service provisioning process and therefore the entities to be considered first. Similar to Physics and Engineering Sciences, ser...
Werner Zorn
PVLDB
2008
81views more  PVLDB 2008»
13 years 9 months ago
Optimization of multi-domain queries on the web
Where can I attend an interesting database workshop close to a sunny beach? Who are the strongest experts on service computing based upon their recent publication record and accep...
Daniele Braga, Stefano Ceri, Florian Daniel, David...
IWPC
2008
IEEE
14 years 4 months ago
The Reuse of Grammars with Embedded Semantic Actions
Reusing syntax specifications without embedded arbitrary semantic actions is straightforward because the semantic analysis phases of new applications can feed off trees or other ...
Terence Parr
GREC
2003
Springer
14 years 3 months ago
User Adaptation for Online Sketchy Shape Recognition
This paper presents a method of online sketchy shape recognition that can adapt to different user sketching styles. The adaptation principle is based on incremental active learning...
Zhengxing Sun, Liu Wenyin, Binbin Peng, Bin Zhang,...