Sciweavers

3690 search results - page 577 / 738
» Computation with classical sequents
Sort
View
SIGMOD
2000
ACM
173views Database» more  SIGMOD 2000»
15 years 1 months ago
Efficient Algorithms for Mining Outliers from Large Data Sets
In this paper, we propose a novel formulation for distance-based outliers that is based on the distance of a point from its kth nearest neighbor. We rank each point on the basis o...
Sridhar Ramaswamy, Rajeev Rastogi, Kyuseok Shim
74
Voted
KDD
1995
ACM
108views Data Mining» more  KDD 1995»
15 years 1 months ago
A Statistical Perspective On Knowledge Discovery In Databases
The quest to nd models usefully characterizing data is a process central to the scienti c method, and has been carried out on many fronts. Researchers from an expanding number of ...
John F. Elder IV, Daryl Pregibon
75
Voted
COCO
1991
Springer
112views Algorithms» more  COCO 1991»
15 years 1 months ago
Randomized vs.Deterministic Decision Tree Complexity for Read-Once Boolean Functions
We consider the deterministic and the randomized decision tree complexities for Boolean functions, denoted DC(f) and RC(f), respectively. A major open problem is how small RC(f) ca...
Rafi Heiman, Avi Wigderson
83
Voted
CAISE
2009
Springer
15 years 1 months ago
The Problem of Transitivity of Part-Whole Relations in Conceptual Modeling Revisited
Abstract. Parthood is a relation of fundamental importance in a number of disciplines including cognitive science, linguistics and conceptual modeling. However, one classical probl...
Giancarlo Guizzardi
AIIDE
2008
15 years 16 days ago
A Cover-Based Approach to Multi-Agent Moving Target Pursuit
We explore the task of designing an efficient multi-agent system that is capable of capturing a single moving target, assuming that every agent knows the location of all agents on...
Alejandro Isaza, Jieshan Lu, Vadim Bulitko, Russel...