Filters








31 Hits in 3.3 sec

Page 5533 of Mathematical Reviews Vol. , Issue 95i [page]

1995 Mathematical Reviews  
{For the entire collection see MR 95f:65014.} 95i:65196 65Y20 65L05 Ruohonen, Keijo (SF-TUT; Tampere) Event detection for ODEs and nonrecursive hierarchies.  ...  Successive embedding of oracle machines and simulation by ODEs were used there to get event detection problems ‘dynamically’ hard for any level 2, in the arithmetical hierarchy, but only at the expense  ... 

Page 1733 of Mathematical Reviews Vol. , Issue 95c [page]

1995 Mathematical Reviews  
cooperating grammar systems (325-343); Azaria Paz, An elementary algorithmic problem from an advanced stand- point (344-357); Keijo Ruohonen, Event detection for ODEs and nonrecursive hierarchies (358  ...  proof procedures for a cardinality based language in propositional calculus (71-82); Burchard von Braunmiihl, Romain Gengler and Robert Rettinger, The alternation hierarchy for machines with sublogarithmic  ... 

Constraint Enforcement Through Production Rules: Putting Active Databases at Work

Stefano Ceri, Piero Fraternali, Stefano Paraboschi, Letizia Tanca
1992 IEEE Data Engineering Bulletin  
He devised the current format for the Bulletin, gave it a novel personality, and steered it for more than 10 years. Thanks, Won.  ...  The editorial board for the Bulletin is in transition. Won Kim, the Bulletin's former editor, established the Bulletin and sustained it for many years.  ...  Acknowledgements The authors thank Victor Markowitz and Arie Shoshani for making the LBL tools available for this work.  ... 
dblp:journals/debu/CeriFPT92 fatcat:l25qkyc7rbawjpgj4z3r366l4y

Learning probabilistic datalog rules for information classification and transformation

Henrik Nottelmann, Norbert Fuhr
2001 Proceedings of the tenth international conference on Information and knowledge management - CIKM'01  
Several applications demonstrate the power of learning probabilistic Datalog rules, showing that learning rules is suitable for low dimensional problems (e.g., schema mapping) but inappropriate for higher  ...  Instead of specifying them manually, learning algorithms can be used to learn both rules and weights.  ...  Evaluation is based on the notion of event keys and event expressions. Facts and instantiated rules are basic events, each of them has assigned an event key.  ... 
doi:10.1145/502585.502651 dblp:conf/cikm/NottelmannF01 fatcat:eajam7ize5civalinoxu3fxhea

A note on discreteness and virtuality in analog computing

Giuseppe Trautteur, Guglielmo Tamburrini
2007 Theoretical Computer Science  
The need for physically motivated discreteness and finiteness conditions emerges in models of both analog and digital computing that are genuinely concerned with physically realizable computational processes  ...  The capability for virtual behaviour, that is, the capability of interpreting, storing, transforming, creating the code, and thereby mimicking the behaviour of (Turing) machines, is used here to introduce  ...  We wish to thank Alberto Aloisio and Enzo Marigliano for helpful discussions on physical theory and hardware implementation in digital computing, Wilfried Sieg for longterm and engaging discussions on  ... 
doi:10.1016/j.tcs.2006.10.017 fatcat:2qefz7x4zvcmdk36q6rcvl32ny

Page 1309 of Mathematical Reviews Vol. 27, Issue Index [page]

Mathematical Reviews  
Ruohonen, Keijo Event detection for ODEs and nonrecursive hierarchies. 95i:65196 Schrefler, Bernardo A. see Turska, Ewa, 95j:73081 Sharp, P. W. see Burrage, Kevin, 95¢:65098 Smiley, M. W.  ...  Estimation of potential and real parallelism for ODE solvers. (English summary) 95k:65135 Adzic, Nevenka Z.  ... 

Subject index volumes 1–200

1999 Theoretical Computer Science  
, 1542 Stirling and -, 1365 while-do-od, 1627 Winter thermodynamic model, 3605 while-free programs.  ...  recursive definitions, 191 unique multiset, 2136 solution, 2243 solution, SAT problems with -, 910 solutions, detecting -, 910 solutions for theZ-game and x+-game, 3032 splitting, 1296 splitting  ... 
doi:10.1016/s0304-3975(98)00319-3 fatcat:s22ud3iiqjht7lfbtc3zctk7zm

Informal Introduction to ALGOL 68

C. H. Lindsey, S. G. Van Der Muelen
1972 Biometrics  
, for their encouragement and helpful criticisms of  ...  A. van Wijngaarden and the other authors of th~ ALGOL 68 Report, and also the many members of WG 2.1 . and others in the computing community who read this Introduction in draft form and in its first edition  ...  for event and tens values, of course, depend entirely upon the specific applications.  ... 
doi:10.2307/2528981 fatcat:sgyece5sifdvzagrpkzfthedrm

Page 1163 of Mathematical Reviews Vol. 27, Issue Index [page]

Mathematical Reviews  
Church) 95e:58040 58E07 (35360, 46E35, 47H15, 58C27) Ruohonen, Keijo Event detection for ODEs and nonrecursive hierarchies.  ...  Exact order of best rational approximations for a class of functions. (Russian. English and Russian summaries) Vestnik Beloruss. Gos. Univ. Ser. I Fiz. Mat.  ... 

Gustav Ciamaga, Heinz-Josef Florian, Ron Fein, Bruno Degazio, Kirk Corey, Karl Mohr, Karlheinz Essl, Gordon Monro, James Harley, Robert Del Buono, and Martin Guertner: Roads to Chaos Compact disc Soundprints 9603, 1996; available from Electronic Music Foundation, 116 North Lake Ave., Albany, New York 12206, USA; World Wide Web http://www.cdemusic.org/

Warren Burt
1999 Computer Music Journal  
Steven Bryant's Dancing around the Cathode Campfire for clarinet, marimba, and tape, performed by Brian Resnick (clarinet) and Aaron Zachko (marimba), was an ode to television, based on a theme from a  ...  In between the presentations, audience and composers, many of whom were present for the event, mingled and chatted. Again, a feeling of friendliness and informality prevailed.  ...  "Microtones and alternate fingerings explore the timbral colours of the clarinet," and for me this was the most attractive aspect of the piece. This, and Mr.  ... 
doi:10.1162/comj.1999.23.4.110 fatcat:ljemgu5dszgv7o3o2a5pyhtuyu

Parallelizing FAD Using Compile-Time Analysis Techniques

Brian E. Hart, Patrick Valduriez, Scott Danforth
1989 IEEE Data Engineering Bulletin  
For example, the query language could express complex object fetch and recursion.  ...  for the AR,BRE project.  ...  Acknowledgement: The author thanks Nissim Francez and Oded Shmueli for helpful discussions and comments.  ... 
dblp:journals/debu/HartVD89 fatcat:d5tvd5hoxvcmbmlfzsjiodqmfu

Inductive synthesis of recursive logic programs: achievements and prospects

Pierre Flener, Serap Yıilmaz
1999 The Journal of Logic Programming  
We ®rst overview past and present achievements, focusing on the techniques that were designed specifically for the inductive synthesis of recursive logic programs but also discussing a few general ILP  ...  Then we analyse the prospects of these techniques in this task, investigating their applicability to software engineering as well as to knowledge acquisition and discovery.  ...  Both authors gratefully acknowledge the assistance of some of the designers of the techniques discussed here, for providing us with implementations and missing papers, and for patiently answering our probing  ... 
doi:10.1016/s0743-1066(99)00028-x fatcat:fjeye5sk2ngkvgiwhuykzy2z7e

Making them behave

John Funge, Xiaoyuan Tu
1997 ACM SIGGRAPH 97 Visual Proceedings: The art and interdisciplinary programs of SIGGRAPH '97 on - SIGGRAPH '97  
For applications in computer game development and character animation, recent work in behavioral animation has taken impressive steps toward autonomous, self-animating characters.  ...  The approach is based on interval arithmetic and addresses a number of difficulties in implementing previous approaches.  ...  Collision Detection Collision detection is a geometry problem and has been extensively studied in robotics and computer-aided design as part of the collision avoidance problem.  ... 
doi:10.1145/259081.259253 dblp:conf/siggraph/FungeT97 fatcat:pia4v4ih65hqbm2khx2mzsxraq

Final Statements [chapter]

2009 FPGA-Based Implementation of Signal Processing Systems  
The authors would like to thank Richard Walke and John Gray for motivating a lot of the work at Queen's University Belfast on FPGA.  ...  Acknowledgements The authors have been fortunate to receive valuable help, support and suggestions from numerous colleagues, students and friends.  ...  This domain provides an (id 1 ,id 2 ) a b r a,1 od 1 = r b,1 id 1 r a,2 od 2 = r b,2 id 2 Figure 11 .4 MSDF graph and association balance equations elegant solution to multidimensional scheduling problems  ... 
doi:10.1002/9780470713785.ch14 fatcat:b5uyg6k2qbhnncscazm2ickxki

The Complexity and Expressive Power of Limit Datalog

Mark Kaminski, Egor V. Kostylev, Bernardo Cuenca Grau, Boris Motik, Ian Horrocks
2022 Journal of the ACM  
Therefore, our article provides a unified logical framework for declarative data analysis which can be used as a basis for understanding the impact on expressive power and computational complexity of the  ...  In particular, limit-linear Datalog Z is complete for Δ 2 EXP and captures Δ 2 P over ordered datasets in the sense of descriptive complexity.  ...  Naqvi, Oded Shmueli, and Shalom Tsur. 1991. Set Constructors in a Logic Database Language. J. Log.  ... 
doi:10.1145/3495009 fatcat:m4r4o3vdw5bb5jhtlousdzoi5y
« Previous Showing results 1 — 15 out of 31 results