Sciweavers

490 search results - page 78 / 98
» Practical Extensions to the IFDS Algorithm
Sort
View
FOCS
2008
IEEE
14 years 3 months ago
Near-Optimal Sparse Recovery in the L1 Norm
Abstract— We consider the approximate sparse recovery problem, where the goal is to (approximately) recover a highdimensional vector x ∈ Rn from its lower-dimensional sketch Ax...
Piotr Indyk, Milan Ruzic
TABLEAUX
2000
Springer
14 years 12 days ago
Benchmark Analysis with FaCT
FaCT (Fast Classification of Terminologies) is a Description Logic (DL) classifier that can also be used for modal logic satisfiability testing. The FaCT system includes two reason...
Ian Horrocks
NIPS
2004
13 years 10 months ago
Confidence Intervals for the Area Under the ROC Curve
In many applications, good ranking is a highly desirable performance for a classifier. The criterion commonly used to measure the ranking quality of a classification algorithm is ...
Corinna Cortes, Mehryar Mohri
DEBU
2010
88views more  DEBU 2010»
13 years 9 months ago
SECONDO: A Platform for Moving Objects Database Research and for Publishing and Integrating Research Implementations
Databases supporting time dependent and continuously changing geometries, called moving objects databases, have been studied for about 15 years. The field has been flourishing and...
Ralf Hartmut Güting, Thomas Behr, Christian D...
ICDT
2010
ACM
180views Database» more  ICDT 2010»
14 years 25 days ago
Composing local-as-view mappings: closure and applications
Schema mapping composition is a fundamental operation in schema management and data exchange. The mapping composition problem has been extensively studied for a number of mapping ...
Patricia C. Arocena, Ariel Fuxman, Renée J....