Sciweavers

200 search results - page 5 / 40
» A combinatorial approach to the power of 2 in the number of ...
Sort
View
BMCBI
2010
161views more  BMCBI 2010»
13 years 9 months ago
CGHpower: exploring sample size calculations for chromosomal copy number experiments
Background: Determining a suitable sample size is an important step in the planning of microarray experiments. Increasing the number of arrays gives more statistical power, but ad...
Ilari Scheinin, Jose A. Ferreira, Sakari Knuutila,...
ARITH
2009
IEEE
14 years 3 months ago
Unified Approach to the Design of Modulo-(2n +/- 1) Adders Based on Signed-LSB Representation of Residues
Moduli of the form 2n ± 1, which greatly simplify certain arithmetic operations in residue number systems (RNS), have been of longstanding interest. A steady stream of designs fo...
Ghassem Jaberipur, Behrooz Parhami
CCCG
2006
13 years 10 months ago
2D Triangulation Representation Using Stable Catalogs
The problem of representing triangulations has been widely studied to obtain convenient encodings and space efficient data structures. In this paper we propose a new practical app...
Abdelkrim Mebarki, Luca Castelli Aleardi, Olivier ...
STOC
2003
ACM
126views Algorithms» more  STOC 2003»
14 years 9 months ago
A new approach to dynamic all pairs shortest paths
We study novel combinatorial properties of graphs that allow us to devise a completely new approach to dynamic all pairs shortest paths problems. Our approach yields a fully dynam...
Camil Demetrescu, Giuseppe F. Italiano
ML
2011
ACM
308views Machine Learning» more  ML 2011»
13 years 3 months ago
Relational information gain
Abstract. Type Extension Trees (TET) have been recently introduced as an expressive representation language allowing to encode complex combinatorial features of relational entities...
Marco Lippi, Manfred Jaeger, Paolo Frasconi, Andre...