Sciweavers

4103 search results - page 820 / 821
» Some results on the Collatz problem
Sort
View
JOC
2007
93views more  JOC 2007»
13 years 6 months ago
Robust Information-Theoretic Private Information Retrieval
A Private Information Retrieval (PIR) protocol allows a user to retrieve a data item of its choice from a database, such that the servers storing the database do not gain informat...
Amos Beimel, Yoav Stahl
JSAC
2007
59views more  JSAC 2007»
13 years 6 months ago
On scheduling of peer-to-peer video services
Abstract— Peer-to-peer (P2P) video systems provide a costeffective way for a large number of hosts to colloaborate for video sharing. Two features characterize such a system: 1) ...
Ying Cai, Ashwin Natarajan, Johnny Wong
COMPGEOM
2006
ACM
14 years 7 days ago
Locked and unlocked chains of planar shapes
We extend linkage unfolding results from the well-studied case of polygonal linkages to the more general case of linkages of polygons. More precisely, we consider chains of nonove...
Robert Connelly, Erik D. Demaine, Martin L. Demain...
BMCBI
2007
157views more  BMCBI 2007»
13 years 6 months ago
Improving gene set analysis of microarray data by SAM-GS
Background: Gene-set analysis evaluates the expression of biological pathways, or a priori defined gene sets, rather than that of individual genes, in association with a binary ph...
Irina Dinu, John D. Potter, Thomas Mueller, Qi Liu...
STOC
2003
ACM
114views Algorithms» more  STOC 2003»
14 years 6 months ago
Testing subgraphs in directed graphs
Let H be a fixed directed graph on h vertices, let G be a directed graph on n vertices and suppose that at least n2 edges have to be deleted from it to make it H-free. We show tha...
Noga Alon, Asaf Shapira