Sciweavers

552 search results - page 61 / 111
» Lower bounds for dynamic connectivity
Sort
View
RECOMB
2008
Springer
14 years 10 months ago
Sorting Cancer Karyotypes by Elementary Operations
Since the discovery of the "Philadelphia chromosome" in chronic myelogenous leukemia in 1960, there is an ongoing intensive research of chromosomal aberrations in cancer....
Michal Ozery-Flato, Ron Shamir
ANSS
2004
IEEE
14 years 1 months ago
Adaptive Energy Conservation Model using Dynamic Caching for Wireless Devices
One important issue that has to be taken into account in wireless devices is the energy conservation. Every infrastructureless network must be adaptively self configured particula...
Constandinos X. Mavromoustakis, Helen D. Karatza
FSTTCS
2009
Springer
14 years 4 months ago
Arithmetic Circuits and the Hadamard Product of Polynomials
Motivated by the Hadamard product of matrices we define the Hadamard product of multivariate polynomials and study its arithmetic circuit and branching program complexity. We also...
Vikraman Arvind, Pushkar S. Joglekar, Srikanth Sri...
MFCS
2007
Springer
14 years 3 months ago
Hardness Results for Tournament Isomorphism and Automorphism
A tournament is a graph in which each pair of distinct vertices is connected by exactly one directed edge. Tournaments are an important graph class, for which isomorphism testing ...
Fabian Wagner
COMPGEOM
2003
ACM
14 years 2 months ago
Loops in reeb graphs of 2-manifolds
Given a Morse function over a 2-manifold with or without boundary, the Reeb graph is obtained by contracting the connected components of the level sets to points. We prove tight u...
Kree Cole-McLaughlin, Herbert Edelsbrunner, John H...