Sciweavers

9842 search results - page 1518 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
208
Voted
AAAI
2008
15 years 9 months ago
POIROT - Integrated Learning of Web Service Procedures
POIROT is an integration framework for combining machine learning mechanisms to learn hierarchical models of web services procedures from a single or very small set of demonstrati...
Mark H. Burstein, Robert Laddaga, David McDonald, ...
FLAIRS
2007
15 years 9 months ago
Indexing Documents by Discourse and Semantic Contents from Automatic Annotations of Texts
The basic aim of the model proposed here is to automatically build semantic metatext structure for texts that would allow us to search and extract discourse and semantic informati...
Brahim Djioua, Jean-Pierre Desclés
FAST
2008
15 years 9 months ago
Improving I/O Performance of Applications through Compiler-Directed Code Restructuring
Ever-increasing complexity of large-scale applications and continuous increases in sizes of the data they process make the problem of maximizing performance of such applications a...
Mahmut T. Kandemir, Seung Woo Son, Mustafa Karak&o...
AOSD
2008
ACM
15 years 9 months ago
AJANA: a general framework for source-code-level interprocedural dataflow analysis of AspectJ software
Aspect-oriented software presents new challenges for the designers of static analyses. Our work aims to establish systematic foundations for dataflow analysis of AspectJ software....
Guoqing Xu, Atanas Rountev
ASIACRYPT
2008
Springer
15 years 9 months ago
Strongly Multiplicative and 3-Multiplicative Linear Secret Sharing Schemes
Strongly multiplicative linear secret sharing schemes (LSSS) have been a powerful tool for constructing secure multi-party computation protocols. However, it remains open whether o...
Zhifang Zhang, Mulan Liu, Yeow Meng Chee, San Ling...
« Prev « First page 1518 / 1969 Last » Next »