Results 1  10
of
1,931,544
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 35 (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
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
Tangible bits: towards seamless interfaces between people, bits and atoms
 Proceedings of the SIGCHI conference on Human factors in computing systems, ACM Press: 234241
, 1997
"... This paper presents our vision of Human Computer Interaction (HCI): "Tangible Bits. " Tangible Bits allows users to "grasp & manipulate " bits in the center of users’ attention by coupling the bits with everyday physical objects and architectural surfaces. Tangible Bits also ..."
Abstract

Cited by 1390 (61 self)
 Add to MetaCart
This paper presents our vision of Human Computer Interaction (HCI): "Tangible Bits. " Tangible Bits allows users to "grasp & manipulate " bits in the center of users’ attention by coupling the bits with everyday physical objects and architectural surfaces. Tangible Bits also
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 612 (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 822 (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 883 (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
A Twobit Differentiated Services Architecture for the Internet
, 1997
"... This document presents a differentiated services architecture for the internet. Dave Clark and Van Jacobson each presented work on differentiated services at the Munich IETF meeting [2,3]. Each explained how to use one bit of the IP header to deliver a new kind of service to packets in the internet. ..."
Abstract

Cited by 469 (4 self)
 Add to MetaCart
This document presents a differentiated services architecture for the internet. Dave Clark and Van Jacobson each presented work on differentiated services at the Munich IETF meeting [2,3]. Each explained how to use one bit of the IP header to deliver a new kind of service to packets in the internet
Maximum entropy markov models for information extraction and segmentation
, 2000
"... Hidden Markov models (HMMs) are a powerful probabilistic tool for modeling sequential data, and have been applied with success to many textrelated tasks, such as partofspeech tagging, text segmentation and information extraction. In these cases, the observations are usually modeled as multinomial ..."
Abstract

Cited by 554 (18 self)
 Add to MetaCart
Hidden Markov models (HMMs) are a powerful probabilistic tool for modeling sequential data, and have been applied with success to many textrelated tasks, such as partofspeech tagging, text segmentation and information extraction. In these cases, the observations are usually modeled
Results 1  10
of
1,931,544