Results 1  10
of
646,007
On the Bit Extraction Problem
"... Consider a coloring of the ndimensional Boolean cube with c =2 s colors in such a way that every kdimensional subcube is equicolored, i.e. each color occurs the same number of times. We show that for such a coloring we necessarily have (k − 1)/n ≥ θc = (c/2 − 1)/(c − 1). This resolves the “bit ext ..."
Abstract

Cited by 33 (0 self)
 Add to MetaCart
extraction” or “tresilient functions ” problem (also a special case of the “privacy amplification ” problem) in many cases, such as c − 1n, proving that XOR type colorings are optimal, and always resolves this question to within c/4 in determining the optimal value of k (for any fixed n and c). We also
The Bit Extraction Problem or tResilient Functions
, 1985
"... \Gamma We consider the following adversarial situation. Let n, m and t be arbitrary integers, and let f : f0; 1g n 7! f0; 1g m be a function. An adversary, knowing the function f , sets t of the n input bits, while the rest (n \Gamma t input bits) are chosen at random (independently and with un ..."
Abstract

Cited by 171 (11 self)
 Add to MetaCart
problem formulated above The bit extraction problem was suggested by Brassard and Robert [BRref] and by V...
Two Results on the Bit Extraction Problem
"... An (n; s; t)resilient function is a function f : f1; \Gamma1g n ! f1; \Gamma1g s , such that every element in f1; \Gamma1g s has the same probability to occur when t arbitrary input variables are fixed by an adversary and the remaining n \Gamma t variables are assigned \Gamma1 or 1 uniformly ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
and independently. A basic problem is to find the largest possible t given n and s such that an (n; s; t)resilient function exists. As mentioned in [5, 2, 3] resilient functions have been involving in some interesting cryptographic applications, such as amplifying privacy and generating shared random strings
Two results on the Bit Extraction Problem (Extended Abstract)
"... We study the problem of coloring the ndimensional boolean cube with c = 2 s colors such that in every kdimensional subcube each color appears 2 k =c times. We are interested in the smallest k for which such a coloring exists. This problem is equivalent to the t resilient function problem. A ..."
Abstract
 Add to MetaCart
We study the problem of coloring the ndimensional boolean cube with c = 2 s colors such that in every kdimensional subcube each color appears 2 k =c times. We are interested in the smallest k for which such a coloring exists. This problem is equivalent to the t resilient function problem. A
Wrapper Induction for Information Extraction
, 1997
"... The Internet presents numerous sources of useful informationtelephone directories, product catalogs, stock quotes, weather forecasts, etc. Recently, many systems have been built that automatically gather and manipulate such information on a user's behalf. However, these resources are usually ..."
Abstract

Cited by 624 (30 self)
 Add to MetaCart
are usually formatted for use by people (e.g., the relevant content is embedded in HTML pages), so extracting their content is difficult. Wrappers are often used for this purpose. A wrapper is a procedure for extracting a particular resource's content. Unfortunately, handcoding wrappers is tedious. We
Proof verification and hardness of approximation problems
 IN PROC. 33RD ANN. IEEE SYMP. ON FOUND. OF COMP. SCI
, 1992
"... We show that every language in NP has a probablistic verifier that checks membership proofs for it using logarithmic number of random bits and by examining a constant number of bits in the proof. If a string is in the language, then there exists a proof such that the verifier accepts with probabilit ..."
Abstract

Cited by 797 (39 self)
 Add to MetaCart
We show that every language in NP has a probablistic verifier that checks membership proofs for it using logarithmic number of random bits and by examining a constant number of bits in the proof. If a string is in the language, then there exists a proof such that the verifier accepts
The linkprediction problem for social networks
 J. AMERICAN SOCIETY FOR INFORMATION SCIENCE AND TECHNOLOGY
, 2007
"... Given a snapshot of a social network, can we infer which new interactions among its members are likely to occur in the near future? We formalize this question as the linkprediction problem, and we develop approaches to link prediction based on measures for analyzing the “proximity” of nodes in a ne ..."
Abstract

Cited by 906 (6 self)
 Add to MetaCart
Given a snapshot of a social network, can we infer which new interactions among its members are likely to occur in the near future? We formalize this question as the linkprediction problem, and we develop approaches to link prediction based on measures for analyzing the “proximity” of nodes in a
"GrabCut”  interactive foreground extraction using iterated graph cuts
 ACM TRANS. GRAPH
, 2004
"... The problem of efficient, interactive foreground/background segmentation in still images is of great practical importance in image editing. Classical image segmentation tools use either texture (colour) information, e.g. Magic Wand, or edge (contrast) information, e.g. Intelligent Scissors. Recently ..."
Abstract

Cited by 1130 (36 self)
 Add to MetaCart
The problem of efficient, interactive foreground/background segmentation in still images is of great practical importance in image editing. Classical image segmentation tools use either texture (colour) information, e.g. Magic Wand, or edge (contrast) information, e.g. Intelligent Scissors
Bandera: Extracting Finitestate Models from Java Source Code
 IN PROCEEDINGS OF THE 22ND INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING
, 2000
"... Finitestate verification techniques, such as model checking, have shown promise as a costeffective means for finding defects in hardware designs. To date, the application of these techniques to software has been hindered by several obstacles. Chief among these is the problem of constructing a fini ..."
Abstract

Cited by 654 (33 self)
 Add to MetaCart
Finitestate verification techniques, such as model checking, have shown promise as a costeffective means for finding defects in hardware designs. To date, the application of these techniques to software has been hindered by several obstacles. Chief among these is the problem of constructing a
Nonlinear component analysis as a kernel eigenvalue problem

, 1996
"... We describe a new method for performing a nonlinear form of Principal Component Analysis. By the use of integral operator kernel functions, we can efficiently compute principal components in highdimensional feature spaces, related to input space by some nonlinear map; for instance the space of all ..."
Abstract

Cited by 1573 (83 self)
 Add to MetaCart
possible 5pixel products in 16x16 images. We give the derivation of the method, along with a discussion of other techniques which can be made nonlinear with the kernel approach; and present first experimental results on nonlinear feature extraction for pattern recognition.
Results 1  10
of
646,007