Sciweavers

139 search results - page 8 / 28
» ideal 2000
Sort
View
EWCBR
2000
Springer
13 years 10 months ago
An Efficient Approach to Similarity-Based Retrieval on Top of Relational Databases
This paper presents an approach to realize a case retrieval engine on top of a relational database. In a nutshell the core idea is to approximate a similarity-based retrieval with ...
Jürgen Schumacher, Ralph Bergmann
MOC
2000
80views more  MOC 2000»
13 years 6 months ago
A modification of Shanks' baby-step giant-step algorithm
Abstract. I describe a modification to Shanks' baby-step giant-step algorithm for computing the order n of an element g of a group G, assuming n is finite. My method has the a...
David C. Terr
IDEAL
2000
Springer
13 years 10 months ago
Quantization of Continuous Input Variables for Binary Classification
Quantization of continuous variables is important in data analysis, especially for some model classes such as Bayesian networks and decision trees, which use discrete variables. Of...
Michal Skubacz, Jaakko Hollmén
IDEAL
2000
Springer
13 years 10 months ago
Round-Table Architecture for Communication in Multi-agent Softbot Systems
In multi -agent systems based on softbots, communication architectures have significant influences on system performance as interaction and cooperation of softbots are carried out...
Pham Hong Hanh, Tran Cao Son
IDEAS
2000
IEEE
96views Database» more  IDEAS 2000»
13 years 11 months ago
A Cost Function for Uniformly Partitioned UB-Trees
Most operations of the relational algebra or SQL - like projection with duplicate elimination, join, ordering, group by and aggregations - are efficiently processed using a sorted...
Volker Markl, Rudolf Bayer