Sciweavers

166 search results - page 19 / 34
» Complexity of Some Geometric and Topological Problems
Sort
View
DIALM
2008
ACM
168views Algorithms» more  DIALM 2008»
13 years 10 months ago
Local broadcasting in the physical interference model
In this work we analyze the complexity of local broadcasting in the physical interference model. We present two distributed randomized algorithms: one that assumes that each node ...
Olga Goussevskaia, Thomas Moscibroda, Roger Watten...
ICASSP
2008
IEEE
14 years 3 months ago
Parametric estimation of affine deformations of binary images
We consider the problem of planar object registration on binary images where the aligning transformation is restricted to the group of affine transformations. Previous approaches...
Csaba Domokos, Zoltan Kato, Joseph M. Francos
COMPGEOM
2006
ACM
14 years 2 months ago
Colored intersection searching via sparse rectangular matrix multiplication
In a Batched Colored Intersection Searching Problem (CI), one is given a set of n geometric objects (of a certain class). Each object is colored by one of c colors, and the goal i...
Haim Kaplan, Micha Sharir, Elad Verbin
COCOON
2009
Springer
14 years 3 months ago
Determination of Glycan Structure from Tandem Mass Spectra
Glycans are molecules made from simple sugars that form complex tree structures. Glycans constitute one of the most important protein modifications, and identification of glycans...
Sebastian Böcker, Birte Kehr, Florian Rasche
COMPGEOM
2009
ACM
14 years 3 months ago
Proximity of persistence modules and their diagrams
Topological persistence has proven to be a key concept for the study of real-valued functions defined over topological spaces. Its validity relies on the fundamental property tha...
Frédéric Chazal, David Cohen-Steiner...