Sciweavers

510 search results - page 24 / 102
» Complexity measures and decision tree complexity: a survey
Sort
View
KDD
2006
ACM
155views Data Mining» more  KDD 2006»
14 years 8 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
IGPL
2000
152views more  IGPL 2000»
13 years 8 months ago
An Analysis of Empirical Testing for Modal Decision Procedures
Recent years have seen the emergence of a new generation of heavily-optimised modal decision procedures. Several systems based on such procedures are now available and have proved...
Ian Horrocks, Peter F. Patel-Schneider, Roberto Se...
DNA
2009
Springer
173views Bioinformatics» more  DNA 2009»
14 years 3 months ago
Time-Complexity of Multilayered DNA Strand Displacement Circuits
Recently we have shown how molecular logic circuits with many components arranged in multiple layers can be built using DNA strand displacement reactions. The potential application...
Georg Seelig, David Soloveichik
CORR
2007
Springer
60views Education» more  CORR 2007»
13 years 8 months ago
On Minimal Tree Realizations of Linear Codes
A tree decomposition of the coordinates of a code is a mapping from the coordinate set to the set of vertices of a tree. A tree decomposition can be extended to a tree realization,...
Navin Kashyap
FOCS
2008
IEEE
13 years 8 months ago
Hardness of Nearest Neighbor under L-infinity
Recent years have seen a significant increase in our understanding of high-dimensional nearest neighbor search (NNS) for distances like the 1 and 2 norms. By contrast, our underst...
Alexandr Andoni, Dorian Croitoru, Mihai Patrascu