Sciweavers

4224 search results - page 812 / 845
» Reasoning about Choice
Sort
View
PKDD
2000
Springer
144views Data Mining» more  PKDD 2000»
14 years 1 months ago
Fast Hierarchical Clustering Based on Compressed Data and OPTICS
: One way to scale up clustering algorithms is to squash the data by some intelligent compression technique and cluster only the compressed data records. Such compressed data recor...
Markus M. Breunig, Hans-Peter Kriegel, Jörg S...
ICS
1995
Tsinghua U.
14 years 1 months ago
A Data Cache with Multiple Caching Strategies Tuned to Different Types of Locality
Current data cache organizations fail to deliver high performance in scalar processors for many vector applications. There are two main reasons for this loss of performance: the u...
Antonio González, Carlos Aliagas, Mateo Val...
KBSE
1995
IEEE
14 years 1 months ago
A Model for Decision Maintenance in the WinWin Collaboration Framework
Cost-effective engineering and evolution of complex software must involve the different stakeholders concurrently and collaboratively. The hard problem is providing computer suppo...
Prasanta K. Bose
PODS
1995
ACM
139views Database» more  PODS 1995»
14 years 1 months ago
Normalizing Incomplete Databases
Databases are often incomplete because of the presence of disjunctive information, due to con icts, partial knowledge and other reasons. Queries against such databases often ask q...
Leonid Libkin
SDB
1995
178views Database» more  SDB 1995»
14 years 1 months ago
A Semantics-based Approach to Design of Query Languages for Partial Information
Most of work on partial information in databases asks which operations of standard languages, like relational algebra, can still be performed correctly in the presence of nulls. In...
Leonid Libkin