Sciweavers

4218 search results - page 40 / 844
» Complete sets of cooperations
Sort
View
COMSWARE
2007
IEEE
14 years 2 months ago
BARAKA: A Hybrid Simulator of SANETs
— We present BARAKA, a new simulator for SANETs. The evaluation of algorithms developed for communication and co-operation in this context is usually accomplished separately. On ...
Thomas Halva Labella, Isabel Dietrich, Falko Dress...
WAW
2004
Springer
80views Algorithms» more  WAW 2004»
14 years 1 months ago
Dominating Sets in Web Graphs
In this paper we study the size of generalised dominating sets in two graph processes which are widely used to model aspects of the world-wide web. On the one hand, we show that gr...
Colin Cooper, Ralf Klasing, Michele Zito
ICIP
1998
IEEE
14 years 8 months ago
Covariant Conics Decomposition of Quartics for 2D Object Recognition and Affine Alignment
This paper outlines a geometric parameterization of 2D curves where the parameterization is in terms of geometric invariants and terms that determine an intrinsic coordinate system...
Jean-Philippe Tarel, William Wolovich and David B...
WIOPT
2010
IEEE
13 years 6 months ago
A contracts-based approach for spectrum sharing among cognitive radios
Abstract—Development of dynamic spectrum access and allocation techniques recently have made feasible the vision of cognitive radio systems. However, a fundamental question arise...
Dileep M. Kalathil, Rahul Jain
CORR
2011
Springer
193views Education» more  CORR 2011»
13 years 2 months ago
On the regularity of iterated hairpin completion of a single word
Hairpin completion is an abstract operation modeling a DNA biooperation which receives as input a DNA strand w = xαyα, and outputs w = xαy¯αx, where x denotes the Watson-Cric...
Lila Kari, Steffen Kopecki, Shinnosuke Seki