Sciweavers

2555 search results - page 456 / 511
» Quantifiers and Working Memory
Sort
View
ENTCS
2007
134views more  ENTCS 2007»
14 years 10 months ago
Improving the Decompilation of Java Bytecode to Prolog by Partial Evaluation
The interpretative approach to compilation allows compiling programs by partially evaluating an interpreter w.r.t. a source program. This approach, though very attractive in princ...
Miguel Gómez-Zamalloa, Elvira Albert, Germ&...
SIAMSC
2008
129views more  SIAMSC 2008»
14 years 10 months ago
Bottom-Up Construction and 2: 1 Balance Refinement of Linear Octrees in Parallel
Abstract. In this article, we propose new parallel algorithms for the construction and 2:1 balance refinement of large linear octrees on distributed memory machines. Such octrees a...
Hari Sundar, Rahul S. Sampath, George Biros
AO
2005
147views more  AO 2005»
14 years 10 months ago
Domain modelling and NLP: Formal ontologies? Lexica? Or a bit of both?
There are a number of genuinely open questions concerning the use of domain models in nlp. It would be great if contributors to Applied Ontology could help addressing them rather ...
Massimo Poesio
ML
2010
ACM
142views Machine Learning» more  ML 2010»
14 years 8 months ago
Fast adaptive algorithms for abrupt change detection
We propose two fast algorithms for abrupt change detection in streaming data that can operate on arbitrary unknown data distributions before and after the change. The first algor...
Daniel Nikovski, Ankur Jain
PE
2010
Springer
102views Optimization» more  PE 2010»
14 years 8 months ago
Extracting state-based performance metrics using asynchronous iterative techniques
Solution of large sparse linear fixed-point problems lies at the heart of many important performance analysis calculations. These calculations include steady-state, transient and...
Douglas V. de Jager, Jeremy T. Bradley