Sciweavers

10997 search results - page 136 / 2200
» On the Structure of Complete Sets
Sort
View
SSD
1993
Springer
237views Database» more  SSD 1993»
15 years 10 months ago
A Small Set of Formal Topological Relationships Suitable for End-User Interaction
Topological relationships between spatial objects represent important knowledge that users of geographic information systems expect to retrieve from a spatial database. A di cult t...
Eliseo Clementini, Paolino Di Felice, Peter van Oo...
SIGMOD
2000
ACM
129views Database» more  SIGMOD 2000»
15 years 10 months ago
Mining Frequent Patterns without Candidate Generation
Mining frequent patterns in transaction databases, time-series databases, and many other kinds of databases has been studied popularly in data mining research. Most of the previous...
Jiawei Han, Jian Pei, Yiwen Yin
FSTTCS
2007
Springer
16 years 11 days ago
Order Scheduling Models: Hardness and Algorithms
We consider scheduling problems in which a job consists of components of different types to be processed on m machines. Each machine is capable of processing components of a singl...
Naveen Garg, Amit Kumar, Vinayaka Pandit
CP
2006
Springer
15 years 10 months ago
Performance Prediction and Automated Tuning of Randomized and Parametric Algorithms
Abstract. Machine learning can be utilized to build models that predict the runtime of search algorithms for hard combinatorial problems. Such empirical hardness models have previo...
Frank Hutter, Youssef Hamadi, Holger H. Hoos, Kevi...
JDCTA
2010
228views more  JDCTA 2010»
15 years 1 months ago
Research and Progress of Cluster Algorithms based on Granular Computing
Granular Computing (GrC), a knowledge-oriented computing which covers the theory of fuzzy information granularity, rough set theory, the theory of quotient space and interval comp...
Shifei Ding, Li Xu, Hong Zhu, Liwen Zhang