Sciweavers

685 search results - page 52 / 137
» Closure Operators for Order Structures
Sort
View
WIRTSCHAFTSINFORMATI
2007
15 years 3 months ago
Integration of Conceptual Process Models by the Example of Event-driven Process Chains
It has become common place in business life that companies with related operations engage in a so-called merger in order to benefit from synergies or from combined products and se...
Carlo Simon, Jan Mendling
JACM
2000
131views more  JACM 2000»
15 years 1 months ago
The soft heap: an approximate priority queue with optimal error rate
A simple variant of a priority queue, called a soft heap, is introduced. The data structure supports the usual operations: insert, delete, meld, and findmin. Its novelty is to beat...
Bernard Chazelle
PAMI
2002
86views more  PAMI 2002»
15 years 1 months ago
Recognizing Mathematical Expressions Using Tree Transformation
We describe a robust and efficient system for recognizing typeset and handwritten mathematical notation. From a list of symbols with bounding boxes the system analyzes an expressio...
Richard Zanibbi, Dorothea Blostein, James R. Cordy
IJUFKS
2000
65views more  IJUFKS 2000»
15 years 1 months ago
Some Group Theoretic Aspects of t-Norms
Continuous archimedean t-norms are generated by automorphisms f of ([0; 1]; ), the unit interval with its usual order structure. Such strict t-norms 4 are given by x 4 y = f 1 (f(...
Fred Richman, Elbert A. Walker
IJCNN
2000
IEEE
15 years 5 months ago
Pose Classification Using Support Vector Machines
The field of human-computer interaction has been widely investigated in the last years, resulting in a variety of systems used in different application fields like virtual reality...
Edoardo Ardizzone, Antonio Chella, Roberto Pirrone