Sciweavers

6028 search results - page 208 / 1206
» Randomness as a resource for design
Sort
View
SIGCOMM
2009
ACM
16 years 1 months ago
Tuning message size in opportunistic mobile networks
We describe a new model for studying intermittently connected mobile networks, based on Markovian random temporal graphs, that captures the influence of message size, maximum tol...
John Whitbeck, Vania Conan, Marcelo Dias de Amorim
ISCAS
2008
IEEE
112views Hardware» more  ISCAS 2008»
16 years 1 months ago
Power optimization of weighted bit-product summation tree for elementary function generator
— In this paper we propose a method for lowering the power consumption in our previously proposed method for approximating elementary functions. By rearranging the interconnect o...
Saeeid Tahmasbi Oskuii, Kenny Johansson, Oscar Gus...
153
Voted
ESA
2001
Springer
97views Algorithms» more  ESA 2001»
15 years 11 months ago
Splitting a Delaunay Triangulation in Linear Time
Computing the Delaunay triangulation of n points requires usually a minimum of (n log n) operations, but in some special cases where some additional knowledge is provided, faster a...
Bernard Chazelle, Olivier Devillers, Ferran Hurtad...
JMLR
2010
107views more  JMLR 2010»
15 years 1 months ago
Error-Correcting Ouput Codes Library
In this paper, we present an open source Error-Correcting Output Codes (ECOC) library. The ECOC framework is a powerful tool to deal with multi-class categorization problems. This...
Sergio Escalera, Oriol Pujol, Petia Radeva
JSAC
2006
180views more  JSAC 2006»
15 years 6 months ago
A Tutorial on Decomposition Methods for Network Utility Maximization
A systematic understanding of the decomposability structures in network utility maximization is key to both resource allocation and functionality allocation. It helps us obtain the...
Daniel Pérez Palomar, Mung Chiang