Sciweavers

1732 search results - page 63 / 347
» Sequences of Level 1, 2, 3, ..., k , ..
Sort
View
CIAC
2010
Springer
252views Algorithms» more  CIAC 2010»
15 years 11 months ago
On the Number of Higher Order Delaunay Triangulations
Higher order Delaunay triangulations are a generalization of the Delaunay triangulation which provides a class of well-shaped triangulations, over which extra criteria can be optim...
Dieter Mitsche, Maria Saumell, Rodrigo I. Silveira
BMCBI
2008
114views more  BMCBI 2008»
15 years 6 months ago
Combining classifiers for improved classification of proteins from sequence or structure
Background: Predicting a protein's structural or functional class from its amino acid sequence or structure is a fundamental problem in computational biology. Recently, there...
Iain Melvin, Jason Weston, Christina S. Leslie, Wi...
JGT
2008
83views more  JGT 2008»
15 years 6 months ago
Monochromatic Hamiltonian t-tight Berge-cycles in hypergraphs
Abstract: In any r-uniform hypergraph H for 2 t r we define an runiform t-tight Berge-cycle of length , denoted by C(r,t) , as a sequence of distinct vertices v1, v2, . . . , v ,...
Paul Dorbec, Sylvain Gravier, Gábor N. S&aa...
COCO
2005
Springer
96views Algorithms» more  COCO 2005»
15 years 11 months ago
A Geometric Approach to Information-Theoretic Private Information Retrieval
A t-private private information retrieval (PIR) scheme allows a user to retrieve the ith bit of an n-bit string x replicated among k servers, while any coalition of up to t server...
David P. Woodruff, Sergey Yekhanin
ENDM
2007
93views more  ENDM 2007»
15 years 6 months ago
Measurable sets with excluded distances
For a set of distances D = {d1, . . . , dk} a set A is called D-avoiding if no pair of points of A is at distance di for some i. We show that the density of A is exponentially sma...
Boris Bukh