ACM Home Page

Searching within The Guide for: CCS:I1  (start a new search)

Found 11,078 of 1,394,228

REFINE YOUR SEARCH

ADVANCED SEARCH
Advanced search.  Advanced Search

FEEDBACK
Please provide us with feedback. Please provide us with feedback

Found 11,078 of 1,394,228

Results 1 - 20 of 11,078
Sort by in
Result page: 1   2   3   4   5   6   7   8   9   10    next    >>
1
The step-2 nilpotent (n,n(n+1)/2) sub-Riemannian geometry
April 2006
Journal of Dynamical and Control Systems , Volume 12 Issue 2
Publisher: Kluwer Academic Publishers
Additional Information:full citation, abstract, references, index terms
Bibliometrics:  Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Downloads (Overall): n/a,    Citation Count: 0

We study the sub-Riemannian structure determined by a left-invariant distribution of rank n on a step-2 simply-connected nilpotent Lie group G of dimension n(n+1)/2. We describe a transitive group action that leaves invariant ...


Keywords: exponential mapping, extremal curves, nilpotent Lie algebras, sub-Riemannian geodesics
2
Local overfitting control via leverages
June 2002
Neural Computation , Volume 14 Issue 6
Publisher: MIT Press
Additional Information:full citation, abstract, references, cited by, index terms
Bibliometrics:  Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Downloads (Overall): n/a,    Citation Count: 8

We present a novel approach to dealing with overfitting in black box models. It is based on the leverages of the samples, that is, on the influence that each observation has on the parameters of the model. Since overfitting is the consequence of the ...

3
Nonblocking two-phase commit protocol to avoid unnecessary transaction abort for distributed systems
March 1997
Journal of Systems Architecture: the EUROMICRO Journal , Volume 43 Issue 1-5
Publisher: Elsevier North-Holland, Inc.
Additional Information:full citation, index terms
Bibliometrics:  Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Downloads (Overall): n/a,    Citation Count: 0

Keywords: commit protocol, message exchange, nonblocking
4
A Scalable Hybrid Regular Expression Pattern Matcher
April 2006
FCCM '06: Proceedings of the 14th Annual IEEE Symposium on Field-Programmable Custom Computing Machines (FCCM'06) - Volume 00 , Volume 00
Publisher: IEEE Computer Society
Full text available: Publisher SitePublisher Site
Additional Information:full citation, abstract, index terms
Bibliometrics:  Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Downloads (Overall): n/a,    Citation Count: 1

As new Internet technologies emerge, the ability to do full regular expression pattern matching on network packets to support these new technologies is becoming increasingly important. Current technologies that can benefit from high-speed pattern matching ...

5
Connection calculus theorem proving with multiple built-in theories
February 2000
Journal of Symbolic Computation , Volume 29 Issue 2
Publisher: Academic Press, Inc.
Additional Information:full citation, index terms
Bibliometrics:  Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Downloads (Overall): n/a,    Citation Count: 0
6
An algebra for hierarchically organized text-dominated databases
January 1992
Information Processing and Management: an International Journal , Volume 28 Issue 3
Publisher: Pergamon Press, Inc.
Additional Information:full citation, cited by, index terms
Bibliometrics:  Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Downloads (Overall): n/a,    Citation Count: 16
7
A Java framework for massively distributed symbolic computing
August 1999
Mathematics and Computers in Simulation , Volume 49 Issue 3
Publisher: Elsevier Science Publishers B. V.
Additional Information:full citation, cited by, index terms
Bibliometrics:  Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Downloads (Overall): n/a,    Citation Count: 2

Keywords: Java, massively distributed applications, symbolic computing
8
AXIOM: open source computer algebra system
September 2007
Communications in Computer Algebra , Volume 41 Issue 3
Publisher: ACM
Full text available: PdfPdf (85.16 KB)
Additional Information:full citation, abstract, references, index terms
Bibliometrics:  Downloads (6 Weeks): 2,   Downloads (12 Months): 29,   Downloads (Overall): 61,    Citation Count: 0

Axiom has been in development since 1971. Originally called Scratchpad II, it was developed by IBM under the direction of Richard Jenks[1]. The project evolved over a period of 20 years as a research platform for developing new ideas in computational ...

9
Nilpotent normal form via Carleman linearization (for systems of ordinary differential equations)
June 1991
ISSAC '91: Proceedings of the 1991 international symposium on Symbolic and algebraic computation
Publisher: ACM Request Permissions Request Permissions   
Full text available: PdfPdf (555.30 KB)
Additional Information:full citation, references, cited by, index terms
Bibliometrics:  Downloads (6 Weeks): 4,   Downloads (12 Months): 18,   Downloads (Overall): 77,    Citation Count: 3
10
Fuzzy structures on hyper K-algebras
February 2002
International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems , Volume 10 Issue 1
Publisher: World Scientific Publishing Co., Inc.
Additional Information:full citation, abstract, references, index terms
Bibliometrics:  Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Downloads (Overall): n/a,    Citation Count: 0

In this note first we define the notions of fuzzy hyperK-subalgebra and fuzzy (weak) hyperK-ideal of a hyperK-algebra. Then we state and prove some equivalent conditions for these notions. In particular we conclude that any fuzzy ...


Keywords: fuzzy (weak) hyperK-ideal, fuzzy hyperK-subalgebra, hyperK-algebra
11
Scalable Techniques from Nonparametric Statistics for Real Time Robot Learning
June 2002
Applied Intelligence , Volume 17 Issue 1
Publisher: Kluwer Academic Publishers
Full text available: Publisher SitePublisher Site
Additional Information:full citation, abstract, references, cited by, index terms
Bibliometrics:  Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Downloads (Overall): n/a,    Citation Count: 5

Locally weighted learning (LWL) is a class of techniques from nonparametric statistics that provides useful representations and training algorithms for learning about complex phenomena during autonomous adaptive control of robotic systems. This paper ...


Keywords: incremental learning, internal models, locally weighted learning, motor control, nonparametric regression
12
Symbolic computation of DeWitt-Seeley-Gilkey coefficients on curved manifolds
March 1994
Journal of Symbolic Computation , Volume 17 Issue 3
Publisher: Academic Press, Inc.
Additional Information:full citation, index terms
Bibliometrics:  Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Downloads (Overall): n/a,    Citation Count: 0
13
Constructive universal algebra: An introduction
March 1987
Theoretical Computer Science , Volume 51 Issue 1-2
Publisher: Elsevier Science Publishers Ltd.
Additional Information:full citation, index terms
Bibliometrics:  Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Downloads (Overall): n/a,    Citation Count: 0
14
On Self-Routing in Benes and Shuffle-Exchange Networks
September 1991
IEEE Transactions on Computers , Volume 40 Issue 9
Publisher: IEEE Computer Society
Full text available: Publisher SitePublisher Site
Additional Information:full citation, abstract, references, cited by, index terms
Bibliometrics:  Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Downloads (Overall): n/a,    Citation Count: 6

The authors present self-routing algorithms for realizing the class of linear permutations in various multistage networks such as Benes and 2n-stage shuffle-exchange. Linear permutations are useful in providing fast access of data arrays. In the first ...


Keywords: Benes networks, interconnection networks, multiprocessor interconnection networks., network self-routing, self-routing algorithms, shuffle-exchange networks
15
Inference engine greediness: subsumption and suboptimality
December 1997
Decision Support Systems , Volume 21 Issue 4
Publisher: Elsevier Science Publishers B. V.
Additional Information:full citation, cited by, index terms
Bibliometrics:  Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Downloads (Overall): n/a,    Citation Count: 2

Keywords: expert system optimality, inference engine greediness, subsumption
16
Automata and fixed point logic: a coalgebraic perspective
April 2006
Information and Computation , Volume 204 Issue 4
Publisher: Academic Press, Inc.
Additional Information:full citation, abstract, references, cited by, index terms
Bibliometrics:  Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Downloads (Overall): n/a,    Citation Count: 6

This paper generalizes existing connections between automata and logic to a coalgebraic abstraction level. Let F: Set to Set be a standard functor that preserves weak pullbacks. We introduce various notions of F-automata, devices that operate on pointed ...


Keywords: automata, bisimulation, coalgebra, fixed point operators, game semantics, modal logic, parity games
17
REDUCE-procedures for the study of adjoint symmetries of second-order differential equations
June 1992
Journal of Symbolic Computation , Volume 13 Issue 6
Publisher: Academic Press, Inc.
Additional Information:full citation, index terms
Bibliometrics:  Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Downloads (Overall): n/a,    Citation Count: 0
18
Printing floating-point numbers quickly and accurately
May 1996
PLDI '96: Proceedings of the ACM SIGPLAN 1996 conference on Programming language design and implementation
Publisher: ACM Request Permissions Request Permissions   
Full text available: PdfPdf (901.34 KB)
Additional Information:full citation, abstract, references, cited by, index terms
Bibliometrics:  Downloads (6 Weeks): 4,   Downloads (12 Months): 25,   Downloads (Overall): 362,    Citation Count: 4

This paper presents a fast and accurate algorithm for printing floating-point numbers in both free- and fixed-format modes. In free-format mode, the algorithm generates the shortest, correctly rounded output string that converts to the same number when ...


Keywords: floating-point printing, run-time systems

Also published in:
May 1996 SIGPLAN Notices Volume 31 Issue 5
19
Origami and mathematics (abstract only)
July 2008
Communications in Computer Algebra , Volume 42 Issue 1-2
Publisher: ACM
Additional Information:full citation, abstract, index terms
Bibliometrics:  Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Downloads (Overall): n/a,    Citation Count: 0

Mathematics applied to the design of an origami model can be used to develop the most efficient fold patterns; more simply stated the largest finished model compared to the unit dimensions of origami paper in unfolded shape. Based on the final chapter ...

20
Supervised Template Estimation for Document Image Decoding
December 1997
IEEE Transactions on Pattern Analysis and Machine Intelligence , Volume 19 Issue 12
Publisher: IEEE Computer Society
Full text available: Publisher SitePublisher Site
Additional Information:full citation, abstract, cited by, index terms
Bibliometrics:  Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Downloads (Overall): n/a,    Citation Count: 1

Abstract¿An approach to supervised training of character templates from page images and unaligned transcriptions is proposed. The template training problem is formulated as one of constrained maximum likelihood parameter estimation within the document ...


Keywords: Document image decoding, Markov models, template estimation, character recognition, document recognition, maximum likelihood.
Result page: 1   2   3   4   5   6   7   8   9   10    next    >>