Sciweavers

363 search results - page 59 / 73
» Finding Small Solutions to Small Degree Polynomials
Sort
View
BMCBI
2005
121views more  BMCBI 2005»
13 years 7 months ago
Evaluation of gene importance in microarray data based upon probability of selection
Background: Microarray devices permit a genome-scale evaluation of gene function. This technology has catalyzed biomedical research and development in recent years. As many import...
Li M. Fu, Casey S. Fu-Liu
GLOBECOM
2010
IEEE
13 years 5 months ago
Skip Finite Automaton: A Content Scanning Engine to Secure Enterprise Networks
Abstract--Today's file sharing networks are creating potential security problems to enterprise networks, i.e., the leakage of confidential documents. In order to prevent such ...
Junchen Jiang, Yi Tang, Bin Liu, Yang Xu, Xiaofei ...
ICDT
2009
ACM
150views Database» more  ICDT 2009»
14 years 8 months ago
Optimizing user views for workflows
A technique called user views has recently been proposed to focus user attention on relevant information in response to provenance queries over workflow executions [1, 2]: Given u...
Olivier Biton, Susan B. Davidson, Sanjeev Khanna, ...
STOC
2006
ACM
170views Algorithms» more  STOC 2006»
14 years 8 months ago
Hardness of approximate two-level logic minimization and PAC learning with membership queries
Producing a small DNF expression consistent with given data is a classical problem in computer science that occurs in a number of forms and has numerous applications. We consider ...
Vitaly Feldman
SODA
2010
ACM
149views Algorithms» more  SODA 2010»
14 years 5 months ago
Sharp kernel clustering algorithms and their associated Grothendieck inequalities
abstract Subhash Khot Assaf Naor In the kernel clustering problem we are given a (large) n ? n symmetric positive semidefinite matrix A = (aij) with n i=1 n j=1 aij = 0 and a (sma...
Subhash Khot, Assaf Naor