Sciweavers

178 search results - page 34 / 36
» Extension of the Generalization Complexity Measure to Real V...
Sort
View
FOCS
2008
IEEE
14 years 2 months ago
What Can We Learn Privately?
Learning problems form an important category of computational tasks that generalizes many of the computations researchers apply to large real-life data sets. We ask: what concept ...
Shiva Prasad Kasiviswanathan, Homin K. Lee, Kobbi ...
SIGMOD
2010
ACM
308views Database» more  SIGMOD 2010»
13 years 6 months ago
GBLENDER: towards blending visual query formulation and query processing in graph databases
Given a graph database D and a query graph g, an exact subgraph matching query asks for the set S of graphs in D that contain g as a subgraph. This type of queries find important...
Changjiu Jin, Sourav S. Bhowmick, Xiaokui Xiao, Ja...
CIKM
2009
Springer
14 years 2 months ago
Reducing the risk of query expansion via robust constrained optimization
We introduce a new theoretical derivation, evaluation methods, and extensive empirical analysis for an automatic query expansion framework in which model estimation is cast as a r...
Kevyn Collins-Thompson
CPAIOR
2007
Springer
14 years 1 months ago
Cost-Bounded Binary Decision Diagrams for 0-1 Programming
Abstract. In recent work binary decision diagrams (BDDs) were introduced as a technique for postoptimality analysis for integer programming. In this paper we show that much smaller...
Tarik Hadzic, John N. Hooker
BMCBI
2010
161views more  BMCBI 2010»
13 years 5 months ago
Addressing the Challenge of Defining Valid Proteomic Biomarkers and Classifiers
Background: The purpose of this manuscript is to provide, based on an extensive analysis of a proteomic data set, suggestions for proper statistical analysis for the discovery of ...
Mohammed Dakna, Keith Harris, Alexandros Kalousis,...