Sciweavers

3946 search results - page 397 / 790
» The computational complexity of choice sets
Sort
View
JSAI
2007
Springer
16 years 1 months ago
Towards a Logical Reconstruction of CF-Induction
CF-induction is a sound and complete hypothesis finding procedure for full clausal logic which uses the principle of inverse entailment to compute a hypothesis that logically expl...
Yoshitaka Yamamoto, Oliver Ray, Katsumi Inoue
IDEAS
2006
IEEE
109views Database» more  IDEAS 2006»
16 years 1 months ago
Multi-dimensional Histograms with Tight Bounds for the Error
Histograms are being used as non-parametric selectivity estimators for one-dimensional data. For highdimensional data it is common to either compute onedimensional histograms for ...
Linas Baltrunas, Arturas Mazeika, Michael H. B&oum...
ACSC
2005
IEEE
16 years 1 months ago
Unsupervised Anomaly Detection in Network Intrusion Detection Using Clusters
Most current network intrusion detection systems employ signature-based methods or data mining-based methods which rely on labelled training data. This training data is typically ...
Kingsly Leung, Christopher Leckie
ICCV
2003
IEEE
16 years 27 days ago
Natural Image Statistics for Natural Image Segmentation
Building on recent progress in modeling filter response statistics of natural images we integrate a statistical model into a variational framework for image segmentation. Incorpo...
Matthias Heiler, Christoph Schnörr
RT
2001
Springer
16 years 1 days ago
Opacity Shadow Maps
Opacity shadow maps approximate light transmittance inside a complex volume with a set of planar opacity maps. A volume made of standard primitives (points, lines, and polygons) i...
Tae-Yong Kim 0002, Ulrich Neumann