Sciweavers

7597 search results - page 1448 / 1520
» On the design of metric relations
Sort
View
CIKM
1993
Springer
15 years 2 months ago
Collection Oriented Match
match algorithms that can efficiently handleAbstract complex tests in the presence of large amounts of data. Match algorithms that are capable of handling large amounts of On the o...
Anurag Acharya, Milind Tambe
DISCO
1993
156views Hardware» more  DISCO 1993»
15 years 2 months ago
Variant Handling, Inheritance and Composition in the ObjectMath Computer Algebra Environment
ObjectMath is a high-level programming environment and modeling language for scientific computing which supports variants and graphical browsing in the environment and integrates o...
Peter Fritzson, Vadim Engelson, Lars Viklund
ICALP
1993
Springer
15 years 1 months ago
Exact Asymptotics of Divide-and-Conquer Recurrences
The divide-and-conquer principle is a majoi paradigm of algorithms design. Corresponding cost functions satisfy recurrences that directly reflect the decomposition mechanism used i...
Philippe Flajolet, Mordecai J. Golin
IUI
1993
ACM
15 years 1 months ago
Reducing user effort in collaboration support
incompatibility. We introduce Mona, an operational email system embodying this automatic approach. Mona establishes conversation context independently of user actions through the ...
Andy Cockburn, Harold W. Thimbleby
SAS
1994
Springer
159views Formal Methods» more  SAS 1994»
15 years 1 months ago
Iterative Fixed Point Computation for Type-Based Strictness Analysis
Amtoft has formulated an "on-line" constraint normalization method for solving a strictness inference problem inspired by Wright. From the syntactic form of the normaliz...
Fritz Henglein
« Prev « First page 1448 / 1520 Last » Next »