Sciweavers

1466 search results - page 95 / 294
» Complexity of Reasoning over Temporal Data Models
Sort
View
KDD
2006
ACM
155views Data Mining» more  KDD 2006»
16 years 4 months ago
Camouflaged fraud detection in domains with complex relationships
We describe a data mining system to detect frauds that are camouflaged to look like normal activities in domains with high number of known relationships. Examples include accounti...
Sankar Virdhagriswaran, Gordon Dakin
COCO
2003
Springer
162views Algorithms» more  COCO 2003»
15 years 9 months ago
Near-Optimal Lower Bounds on the Multi-Party Communication Complexity of Set Disjointness
We study the communication complexity of the set disjointness problem in the general multi-party model. For t players, each holding a subset of a universe of size n, we establish ...
Amit Chakrabarti, Subhash Khot, Xiaodong Sun
COLT
2005
Springer
15 years 10 months ago
A PAC-Style Model for Learning from Labeled and Unlabeled Data
Abstract. There has been growing interest in practice in using unlabeled data together with labeled data in machine learning, and a number of different approaches have been develo...
Maria-Florina Balcan, Avrim Blum
DLOG
2010
15 years 2 months ago
Checking Full Satisfiability of Conceptual Models
Abstract. UML class diagrams (UCDs) are the de-facto standard formalism for the analysis and design of information systems. By adopting formal language techniques to capture constr...
Alessandro Artale, Diego Calvanese, Yazmin Ang&eac...
ISCI
2008
93views more  ISCI 2008»
15 years 4 months ago
Safety, domain independence and translation of complex value database queries
This paper considers the theory of database queries on the complex value data model with external functions. Motivated by concerns regarding query evaluation, we first identify re...
Hong-Cheu Liu, Jeffrey Xu Yu, Weifa Liang