Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
SODA
2010
ACM
181views Algorithms» more  SODA 2010»
10 years 10 months ago
Near-Optimal Sublinear Time Algorithms for Ulam Distance
We give near-tight bounds for estimating the edit distance between two non-repetitive strings (Ulam distance) with constant approximation, in sub-linear time. For two strings of l...
Alexandr Andoni, Huy L. Nguyen
PPSN
2010
Springer
10 years 10 months ago
General Lower Bounds for the Running Time of Evolutionary Algorithms
Abstract. We present a new method for proving lower bounds in evolutionary computation based on fitness-level arguments and an additional condition on transition probabilities bet...
Dirk Sudholt
PE
2010
Springer
144views Optimization» more  PE 2010»
10 years 10 months ago
Capacity scaling of large wireless networks with heterogeneous clusters
We analyze the capacity scaling laws of wireless networks where the spatial distribution of nodes over the network area exhibits a high degree of clustering. In particular we cons...
Valentina Martina, Michele Garetto, Emilio Leonard...
TIT
2008
109views more  TIT 2008»
10 years 10 months ago
Joint Source-Channel Codes for MIMO Block-Fading Channels
We consider transmission of a continuous amplitude source over an L-block Rayleigh fading Mt
Deniz Gündüz, Elza Erkip
ADCM
2008
119views more  ADCM 2008»
10 years 10 months ago
Bounds on the dimensions of trivariate spline spaces
We derive upper and lower bounds on the dimensions of trivariate spline spaces defined on tetrahedral partitions. The results hold for general partitions, and for all degrees of sm...
Peter Alfeld, Larry L. Schumaker
ORL
2007
54views more  ORL 2007»
10 years 11 months ago
A new lower bound for the non-oriented two-dimensional bin-packing problem
We propose a new scheme for computing lower bounds for the non-oriented bin-packing problem when the bin is a square. It leads to bounds that theoretically dominate previous resul...
François Clautiaux, Antoine Jouglet, Joseph...
AMC
2008
94views more  AMC 2008»
10 years 11 months ago
Equality conditions for lower bounds on the smallest singular value of a bidiagonal matrix
Several lower bounds have been proposed for the smallest singular value of a square matrix, such as Johnson's bound, Brauer-type bound, Li's bound and Ostrowskitype boun...
Yusaku Yamamoto
SIAMCOMP
2002
113views more  SIAMCOMP 2002»
10 years 11 months ago
A Layered Analysis of Consensus
This paper introduces a simple notion of layering as a tool for analyzing well-behaved runs of a given model of distributed computation. Using layering, a model-independent analysi...
Yoram Moses, Sergio Rajsbaum
JGAA
1998
116views more  JGAA 1998»
10 years 11 months ago
New Lower Bounds For Orthogonal Drawings
An orthogonal drawing of a graph is an embedding of the graph in the two-dimensional grid such that edges are routed along grid-lines. In this paper we explore lower bounds for or...
Therese C. Biedl
JCSS
1998
65views more  JCSS 1998»
10 years 11 months ago
Good Degree Bounds on Nullstellensatz Refutations of the Induction Principle
This paper gives nearly optimal, logarithmic upper and lower bounds on the minimum degree of Nullstellensatz refutations (i.e., polynomials) of the propositional induction princip...
Samuel R. Buss, Toniann Pitassi
books