153,324 Hits in 6.5 sec

Extended Abstracts

2010 Cartilage  
ICRS unicompartmental knee replacement since the 2007 extended ICRS unicompartmental knee replacement since the 2007 extended ICRS abstract on the topic.1 The term applies to resurfacing either one abstract  ...  on the topic.1 The term applies to resurfacing either one abstract on the topic.1 The term applies to resurfacing either one unicompartmental knee replacement since the 2007 extended ICRS abstract on  ...  This technique may further help in the non-invasive, non destructive follow-up of patients operated on new generations of destructive follow-up of patients operated on new generations of destructive follow-up  ... 
doi:10.1177/1947603510386038 pmid:26075041 pmcid:PMC4300817 fatcat:m2mv3tnf6vhzndubvwdtltkh5y

Granule-oriented programming (extended abstract)

Yinliang Zhao
2004 Companion to the 19th annual ACM SIGPLAN conference on Object-oriented programming systems, languages, and applications - OOPSLA '04  
File I/O PPS0 Fits Data source, Performance Fits special cases; Unfits general cases PPS1 Data source, Performance Fits Fits special cases; Ufits general cases PPS2 Fits Data source,  ...  GOP assumes that domain problems can be solved using a gradually generated program. This means the domain can be described partially by some primary problem solving cases.  ... 
doi:10.1145/1028664.1028716 dblp:conf/oopsla/Zhao04 fatcat:coidll46fbdpxcgufrmxtdhiuu

Multiparty Dependent Session Types (Extended Abstract) [article]

Hanwen Wu, Hongwei Xi
2018 arXiv   pre-print
The type system is formulated in the setting of multi-threaded λ-calculus with inspirations from multirole logic, a generalization of classical logic we discovered earlier.  ...  We define partial ad-hoc redexes in Figure 8 . Only matching partial redexes can reduce according to some pool reduction rules. Definition 3 (Matching Partial Redexes).  ...  A session is an abstraction of structured communication among two or more logical parties connected by a communication channel.  ... 
arXiv:1808.00077v1 fatcat:xzms3ivryvaqvinjt7uozhwzu4

Generating Representative Executions [Extended Abstract]

Hendrik Maarand, Tarmo Uustalu
2017 Electronic Proceedings in Theoretical Computer Science  
abnormal executions during the generation phase.  ...  This paper presents a generic framework that allows to specify the possible behaviours of the execution environment, and generate all Foata-normal executions of a program, for that environment, by discarding  ...  The dependency relation for a prefix s will be denoted by D s and the subscript is omitted, if the relation is static.  ... 
doi:10.4204/eptcs.246.8 fatcat:2hfbndtzxzfdhhidabilmgxfr4

Extending the scope of syntactic abstraction

Oscar Waddell, R. Kent Dybvig
1999 Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '99  
The system is fully static, permits mutually recursive modules, and supports separate compilation.  ...  The benefits of module systems and lexically scoped syntactic abstraction (macro) facilities are well-established in the literature.  ...  Section 2 describes an extended language that supports both modules and syntactic abstraction.  ... 
doi:10.1145/292540.292559 dblp:conf/popl/WaddellD99 fatcat:kr4h4a3ot5d43ja57zwxiwvaxa

Semantic Essence of AsmL: Extended Abstract [chapter]

Yuri Gurevich, Benjamin Rossman, Wolfram Schulte
2004 Lecture Notes in Computer Science  
The Abstract State Machine Language, AsmL, is a novel executable specification language based on the theory of Abstract State Machines.  ...  AsmL is object-oriented, provides high-level mathematical data-structures, and is built around the notion of synchronous updates and finite choice.  ...  T T (e) is a partial function from expressions and type contexts to types. If T T (e) is defined, then e is said to be well-typed with respect to T , and T T (e) is called its static type.  ... 
doi:10.1007/978-3-540-30101-1_11 fatcat:u2yioofwxnfgjiu5uqaxql566e

Exploring the Conformance Space (Extended abstract)

Andrea Burattin, Alessandro Gianola, Hugo A. López, Marco Montali
2021 International Conference on Business Process Management  
In this position paper, we demonstrate why existing model-driven and data-driven techniques are not enough to attack the problem in its full generality, and that novel methods to combine them in ways that  ...  In this paper we highlight a yet unexplored dimension in BPM in general, and conformance checking, in particular.  ...  Acknowledgements This research has been partially supported by the UNIBZ projects VERBA and DACOMAN and the EcoKnow project.  ... 
dblp:conf/bpm/BurattinGLM21 fatcat:yawxptupobdwpc2fdubrtz6huy

Indexing moving points (extended abstract)

Pankaj K. Agarwal, Lars Arge, Jeff Erickson
2000 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems - PODS '00  
Next, we present a general approach that improves the query time if the queries arrive in chronological order, by allowing the index to evolve over time.  ...  Omitting the analysis from this extended abstract, we conclude: Theorem 4.6.  ...  Our construction is similar to a general technique used to establish tradeo s between data structure size and query time 2].  ... 
doi:10.1145/335168.335220 dblp:conf/pods/AgarwalAE00 fatcat:g7cmr7zn7vbspokk4gx37gr3fe

Private information storage (extended abstract)

Rafail Ostrovsky, Victor Shoup
1997 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing - STOC '97  
., so that individual databases do not get any information about the data or the nature of the users' queries.  ...  In fact, we show a general information-theoretic reduction from reading and writing to any read-only scheme that preserves the communication complexity of the read scheme to within a poly-logarithmic factor  ...  At the end of the rst period of the cycle, the bu er has been lled perhaps only partially and we switch the roles of the bu er and primary data vector.  ... 
doi:10.1145/258533.258606 dblp:conf/stoc/OstrovskyS97 fatcat:rqudnxi7mjcufdfwnh3iatvcu4

Temporally coherent conservative visibility (extended abstract)

Satyan Coorg, Seth Teller
1996 Proceedings of the twelfth annual symposium on Computational geometry - SCG '96  
In essence, the algorithm implicitly constructs and maintains a linearized portion of an aspect graph, a data structure for representing visual events.  ...  The overestimation guarantees that the generated image is identical to that which w ould be generated by rendering every polygon in the scene.  ...  Another way to extend the algorithm is to identify some invisible polygons that are occluded by m ultiple colluding convex objects or non-convex objects.  ... 
doi:10.1145/237218.237242 dblp:conf/compgeom/CoorgT96 fatcat:75q7xi7spnatjioxyx6642rtk4

Extending abstract argumentation systems theory

P. Baroni, M. Giacomin, G. Guida
2000 Artificial Intelligence  
In this paper, we extend the theory of abstract argumentation systems proposed by Vreeswijk (1997) .  ...  This framework stands at a high abstraction level and provides a general model for argumentation activity.  ...  partial order on arguments.  ... 
doi:10.1016/s0004-3702(00)00030-8 fatcat:gms5lgglvfchtn6yqm2z3a4pam

αSPIN: Extending SPIN with Abstraction [chapter]

María del Mar Gallardo, Jesús Martínez, Pedro Merino, Ernesto Pimentel
2002 Lecture Notes in Computer Science  
) tool for the abstract model.  ...  This paper presents the details of αspin, an xml-based tool to abstract promela models in order to employ spin as an abstract model checking tool. αspin is built on the top of spin which allows us to take  ...  With this additional data, users can easily extract the partial order defined over the abstract domain.  ... 
doi:10.1007/3-540-46017-9_24 fatcat:jffej57r4zge3ajup6d3mbf4l4

Challenges in Learning from Streaming Data Extended Abstract [chapter]

João Gama
2015 Advances in Intelligent Systems and Computing  
In the static case, similar data can be described with different schemata. In the case of dynamic streams, the schema of the stream can also change.  ...  Most of evaluation methods and metrics were designed for the static case and provide a single measurement about the quality of the hypothesis.  ... 
doi:10.1007/978-3-319-09879-1_1 fatcat:stk5dgstwnf7homy4kssj3eo6m

Towards Proactive Spam Filtering (Extended Abstract) [chapter]

Jan Göbel, Thorsten Holz, Philipp Trinius
2009 Lecture Notes in Computer Science  
The collected data can then be used to improve current spam filtering techniques and develop new venues to efficiently filter mails.  ...  Based on the collected information we are able to generate templates that represent a concise summary of a spam run.  ...  Furthermore, since we only collect spam messages, we can use them to generate filtering rules.  ... 
doi:10.1007/978-3-642-02918-9_3 fatcat:bzr2irhvsvdifg5zkhj2eju4qa

Experience-driven procedural content generation (Extended abstract)

Georgios N. Yannakakis, Julian Togelius
2015 2015 International Conference on Affective Computing and Intelligent Interaction (ACII)  
This paper introduces a framework for procedural content generation driven by computational models of user experience we name Experience-Driven Procedural Content Generation.  ...  Procedural content generation is an increasingly important area of technology within modern human-computer interaction with direct applications in digital games, the semantic web, and interface, media  ...  A key distinction is between static and dynamic simulationbased functions.  ... 
doi:10.1109/acii.2015.7344619 dblp:conf/acii/YannakakisT15 fatcat:ysn7onigmvg3zcwdodpsiqds5y
« Previous Showing results 1 — 15 out of 153,324 results