Sciweavers

2095 search results - page 30 / 419
» Improved pebbling bounds
Sort
View
GC
2011
Springer
13 years 1 months ago
A Note on the Complexity of Real Algebraic Hypersurfaces
Given an algebraic hypersurface O in Êd, how many simplices are necessary for a simplicial complex isotopic to O? We address this problem and the variant where all vertices of the...
Michael Kerber, Michael Sagraloff
ESA
2008
Springer
134views Algorithms» more  ESA 2008»
13 years 11 months ago
A Near-Tight Bound for the Online Steiner Tree Problem in Graphs of Bounded Asymmetry
The edge asymmetry of a directed, edge-weighted graph is defined as the maximum ratio of the weight of antiparallel edges in the graph, and can be used as a measure of the heterog...
Spyros Angelopoulos
BMCBI
2006
141views more  BMCBI 2006»
13 years 10 months ago
Maximum common subgraph: some upper bound and lower bound results
Background: Structure matching plays an important part in understanding the functional role of biological structures. Bioinformatics assists in this effort by reformulating this p...
Xiuzhen Huang, Jing Lai, Steven F. Jennings
CRYPTO
2005
Springer
94views Cryptology» more  CRYPTO 2005»
14 years 3 months ago
Improved Security Analyses for CBC MACs
We present an improved bound on the advantage of any q-query adversary at distinguishing between the CBC MAC over a random n-bit permutation and a random function outputting n bit...
Mihir Bellare, Krzysztof Pietrzak, Phillip Rogaway
COMPGEOM
2010
ACM
14 years 2 months ago
Improving the first selection lemma in R3
We present new bounds on the first selection lemma in R3 . This makes progress on the open problems of Bukh, Matoušek and Nivash [6] and Boros-Füredi [4] for the three-dimensio...
Abdul Basit, Nabil H. Mustafa, Saurabh Ray, Sarfra...