Sciweavers

178 search results - page 27 / 36
» combinatorics 2007
Sort
View
BIB
2007
99views more  BIB 2007»
13 years 11 months ago
Towards a calculus of biomolecular complexes at equilibrium
An overview is presented of the construction and use of algebraic partition functions to represent the equilibrium statistical mechanics of multimolecular complexes and their acti...
Eric Mjolsness
JUCS
2007
105views more  JUCS 2007»
13 years 10 months ago
Graded Sparse Graphs and Matroids
: Sparse graphs and their associated matroids play an important role in rigidity theory, where they capture the combinatorics of some families of generic minimally rigid structures...
Audrey Lee, Ileana Streinu, Louis Theran
CPM
2007
Springer
102views Combinatorics» more  CPM 2007»
14 years 5 months ago
Improved Sketching of Hamming Distance with Error Correcting
We address the problem of sketching the hamming distance of data streams. We present a new notion of sketching technique, Fixable sketches and we show that using such sketch not o...
Ely Porat, Ohad Lipsky
COCOON
2007
Springer
14 years 5 months ago
Priority Algorithms for the Subset-Sum Problem
Greedy algorithms are simple, but their relative power is not well understood. The priority framework [5] captures a key notion of “greediness” in the sense that it processes (...
Yuli Ye, Allan Borodin
IANDC
2007
66views more  IANDC 2007»
13 years 10 months ago
Exponential lower bounds for the number of words of uniform length avoiding a pattern
We study words on a finite alphabet avoiding a finite collection of patterns. Given a pattern p in which every letter that occurs in p occurs at least twice, we show that the nu...
Jason P. Bell, Teow Lim Goh