ENTCS 2002 - PDF Preprint Papers

ENTCS 2002

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed ENTCS-2002 Paper

click to vote

ENTCS
2002

207views more ENTCS 2002»

Efficient Algorithms for the Maximum Subarray Problem by Distance Matrix Multiplication

14 years 7 days ago

Download www.cosc.canterbury.ac.nz

We design an efficient algorithm that maximizes the sum of array elements of a subarray of a two-dimensional array. The solution can be used to find the most promising array porti...

Tadao Takaoka

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	207	Efficient Algorithms for the Maximum Subarray Problem by Distance Matrix Multiplication	claim
2	181	Alias verification for Fortran code optimization	claim
3	166	Translation and Run-Time Validation of Optimized Code	claim
4	157	Arguments and Misunderstandings: Fuzzy Unification for Negotiating Agents	claim
5	152	Contract-based mutation testing in the refinement calculus	claim
6	152	Abstract Logics as Dialgebras	claim
7	148	A Declarative Debugging System for Lazy Functional Logic Programs	claim
8	145	Combining Monitors for Runtime System Verification	claim
9	144	Comparative Analysis of Architectural Views Based on UML	claim
10	144	Logics and Multi-agents: towards a new symbolic model of cognition	claim
11	143	Collecting Statistics over Runtime Executions	claim
12	141	Graph Based Debugging with Fujaba	claim
13	141	Coalgebraic Monads	claim
14	139	Automatic Verification of the IEEE-1394 Root Contention Protocol with KRONOS and PRISM	claim
15	136	Final Coalgebras And a Solution Theorem for Arbitrary Endofunctors	claim
16	136	Comparing Calculi of Explicit Substitutions with Eta-reduction	claim
17	134	Implementing Compositional Analysis Using Intersection Types With Expansion Variables	claim
18	132	Action Semantics and ASF+SDF: System Demonstration	claim
19	131	Automatic Generation of Language-based Tools	claim
20	129	Argumentative Agent Deliberation, Roles and Context	claim
21	129	Eliminating Proofs from Programs	claim
22	128	Rewriting Calculus with(out) Types	claim
23	127	A Calculus for "Environment-Aware" Computation	claim
24	125	Pathway Logic: Executable Models of Biological Networks	claim
25	125	Specification of Logic Programming Languages from Reusable Semantic Building Blocks	claim
26	121	Modal Predicates and Co-equations	claim
27	121	Regular Expression Types for Strings in a Text Processing Language	claim
28	120	Composition of Distributed Software with Algon - Concepts and Possibilities	claim
29	118	Rank 2 Types for Term Graph Rewriting	claim
30	115	Component-Based Applications: A Dynamic Reconfiguration Approach with Fault Tolerance Support	claim
31	114	Adjunction Models For Call-By-Push-Value With Stacks	claim
32	113	An Operational Semantics for Declarative Multi-Paradigm Languages	claim
33	113	A monadic approach to polycategories	claim
34	112	Ambient Calculus and its Logic in the Calculus of Inductive Constructions	claim
35	111	Comparing Meseguer's Rewriting Logic with the Logic CRWL	claim
36	110	The Solution Operator of the Korteweg-de Vries Equation is Computable	claim
37	110	Uniform Solution of Parity Games on Prefix-Recognizable Graphs	claim
38	109	Induction, Coinduction, and Adjoints	claim
39	108	Rewriting in the partial algebra of typed terms modulo AC	claim
40	108	Bisimulation Relations for Dynamical and Control Systems	claim
41	107	Declarative Debugging for Encapsulated Search	claim
42	107	Monitoring, Checking, and Steering of Real-Time Systems	claim
43	106	Refactoring by Transformation	claim
44	105	Towards component based systems: refining connectors	claim
45	105	Fixed points in digital topology (via Helly posets)	claim
46	105	Barbs and Congruences for Safe Mobile Ambients	claim
47	104	A Note on Coalgebras and Presheaves	claim
48	103	Translation from timed Petri nets with intervals on transitions to intervals on places (with urgency)	claim
49	103	Deciding low levels of tree-automata hierarchy	claim
50	101	Hypergeometric Functions in Exact Geometric Computation	claim
51	101	Towards Automatic Mediation between Heterogeneous Software Components	claim
52	101	A categorical framework for typing CCS-style process communication	claim
53	99	Greatest Bisimulations for Binary Methods	claim
54	98	Building Interpreters with Rewriting Strategies	claim
55	98	Verified Code Generation for Embedded Systems	claim
56	97	Semantic domains for Handel-C	claim
57	97	Sketch Data Models, Relational Schema and Data Specifications	claim
58	97	Plan in Maude: Specifying an Active Network Programming Language	claim
59	95	A Proof Dedicated Meta-Language	claim
60	95	Deriving Bisimulation Congruences: A 2-categorical Approach	claim
61	93	Matroids from modules	claim
62	93	A Tool for Abstraction in Model Checking	claim
63	93	An Abstract Machine for a Higher-Order Distributed Process Calculus	claim
64	92	Improving the Efficiency of Non-Deterministic Computations	claim
65	92	PLCTools: Graph Transformation Meets PLC Design	claim
66	92	The Relevance of Semantic Subtyping	claim
67	91	The Grammar Deployment Kit - System Demonstration	claim
68	91	Interval Duration Logic: Expressiveness and Decidability	claim
69	91	Memoization-Based Proof Search in LF - an Experimental Evaluation of a Prototype	claim
70	91	Petri nets with causal time for system verification	claim
71	91	Subtyping in Logical Form	claim
72	90	Simple Easy Terms	claim
73	90	Guardians for Ambient-based Monitoring	claim
74	90	A Language for Multi-dimensional Updates	claim
75	90	Specifying Graph-like Diagrams with DIAGEN	claim
76	90	Inorder traversal of splay trees	claim
77	90	Refactoring in maintenance and development of Z specifications	claim
78	89	ZEUS: A Distributed Timed Model-Checker Based on KRONOS	claim
79	89	Bounded Model Checking for Timed Automata	claim
80	88	Testing Concurrent Java Programs using Randomized Scheduling	claim
81	87	Parking can get you there faster - Model Augmentation to Speed up Real-Time Model-Checking	claim
82	85	Dynamic Event Generation for Runtime Checking using the JDI	claim
83	85	Coinductive Counting: Bisimulation in Enumerative Combinatorics	claim
84	84	Programming Autonomous Robots in Curry	claim
85	84	Set Types and Applications	claim
86	84	VOC: A Translation Validator for Optimizing Compilers	claim
87	83	Operational Semantics for Functional Logic Languages	claim
88	82	GSOS for Probabilistic Transition Systems	claim
89	82	A Hybrid Encoding of Howe's Method for Establishing Congruence of Bisimilarity	claim
90	80	Strong Normalization with Singleton Types	claim
91	80	Monotonic Extensions of Petri Nets: Forward and Backward Search Revisited	claim
92	80	Some Co-Birkhoff Type Theorems	claim
93	80	Comprehension for Coalgebras	claim
94	80	Metaprogramming Applied to Web Component Deployment	claim
95	79	Debugging and Testing Optimizers through Comparison Checking	claim
96	78	ESUIF: An Open Esterel Compiler	claim
97	78	Theoretical Foundations of Value Withdrawal Explanations for Domain Reduction	claim
98	78	Slicing Synchronous Reactive Programs	claim
99	78	Towards ANSI C Program Slicing using XML	claim
100	78	What can we do with a Solution?	claim
101	78	The Impact of Linearity Information on the Performance of TyCO	claim
102	78	Separating concerns in a high-level component-based context	claim
103	77	Trivial Reals	claim
104	77	Towards Coalgebraic Behaviourism	claim
105	77	Syntactic Type Soundness for HM(X)	claim
106	77	The variety of variables in computer-aided real-time programming	claim
107	77	A Call Abstraction for Component Coordination	claim
108	76	Non-Uniform Hypercoherences	claim
109	76	Feasible functionals and intersection of ramified types	claim
110	76	Four equivalent equivalences of reductions	claim
111	76	A Syntactical Approach to Weak (Bi-)Simulation for Coalgebras	claim
112	75	jContractor: Bytecode Instrumentation Techniques for Implementing Design by Contract in Java	claim
113	73	A Conference Reviewing System in Mobile Maude	claim
114	73	Reducing the Overhead of Dynamic Analysis	claim
115	72	Language Design Issues for Agents based on Linear Logic (Extended Abstract)	claim
116	72	A Symbolic Out-of-Core Solution Method for Markov Models	claim
117	72	The synchronized graphs trace the context-sensitive languages	claim
118	71	A Simplified Account of the Metatheory of Linear LF	claim
119	69	Tiling Transactions in Rewriting Logic	claim
120	69	The Uniformity Principle on Traced Monoidal Categories	claim
121	69	Isolating Resource Consumption in Linear Logic Proof Search	claim
122	69	Modular Synthesis of Timed Circuits using Partial Order Reduction	claim
123	67	Systematic Component Adaptation	claim
124	67	Describing Hierarchical Compositions of Java Beans with the Beanome Language	claim
125	67	Well-behaved Translations between Structural Operational Semantics	claim
126	66	Online train disposition: to wait or not to wait?	claim
127	66	Strongly Normalising Cut-Elimination with Strict Intersection Types	claim
128	66	Non Truth-Functional Many-Valuedness	claim
129	66	Unique, guarded fixed points in an additive setting: Extended Abstract	claim
130	66	Rule Formats for Timed Processes	claim
131	65	Superposition: Composition vs refinement of non-deterministic action-based systems	claim
132	64	Maximal Introspection of Agents	claim
133	64	Liveness Checking as Safety Checking	claim
134	64	States of Knowledge	claim
135	64	Mobile Channels, Implementation Within and Outside Components	claim
136	63	A Category-Theoretic Approach to Social Network Analysis	claim
137	62	Model Checking Games	claim
138	61	Context-Sensitive Visibility	claim
139	61	Effectively Absolute Continuity and Effective Jordan Decomposability	claim
140	60	Incremental Evaluators for Remote Attribute Grammars	claim
141	60	Heuristic-driven Techniques for Test Case Selection	claim
142	58	Prefix and Projection onto State in Duration Calculus	claim
143	58	Computability of Partial Delaunay Triangulation and Voronoi Diagram	claim
144	58	From Parity Games to Circular Proofs	claim
145	56	Using Assumptions to Distribute CTL Model Checking	claim
146	54	An Open Visualization Framework for Metamodel-Based Modeling Languages	claim
147	53	Requirements for a Practical Network Event Recognition Language	claim
148	52	Correct and Complete (Positive) Strategy Annotations for OBJ	claim
149	51	A Logical Process Calculus	claim
150	51	Using Secondary Structure Information for Protein Folding in CLP(FD)	claim
151	48	Requirements, specifications, and minimal refinement	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers