Sciweavers

1923 search results - page 328 / 385
» Modeling Complexity in Secure Distributed Computing
Sort
View
ATAL
2008
Springer
14 years 11 months ago
Automated design of scoring rules by learning from examples
Scoring rules are a broad and concisely-representable class of voting rules which includes, for example, Plurality and Borda. Our main result asserts that the class of scoring rul...
Ariel D. Procaccia, Aviv Zohar, Jeffrey S. Rosensc...
ICANNGA
2009
Springer
145views Algorithms» more  ICANNGA 2009»
15 years 4 months ago
Supporting Scalable Bayesian Networks Using Configurable Discretizer Actuators
We propose a generalized model with configurable discretizer actuators as a solution to the problem of the discretization of massive numerical datasets. Our solution is based on a ...
Isaac Olusegun Osunmakinde, Antoine B. Bagula
CCGRID
2007
IEEE
15 years 4 months ago
Analysis and Synthesis of Pseudo-Periodic Job Arrivals in Grids: A Matching Pursuit Approach
Pseudo-periodicity is one of the basic job arrival patterns on data-intensive clusters and Grids. In this paper, a signal decomposition methodology called matching pursuit is appl...
Hui Li, Richard Heusdens, Michael Muskulus, Lex Wo...
TCAD
2010
150views more  TCAD 2010»
14 years 4 months ago
Voltage and Temperature Aware Statistical Leakage Analysis Framework Using Artificial Neural Networks
Artificial neural networks (ANNs) have shown great promise in modeling circuit parameters for computer aided design applications. Leakage currents, which depend on process paramete...
Janakiraman Viraraghavan, Bharadwaj Amrutur, V. Vi...
AVI
2008
15 years 1 days ago
Agent warp engine: formula based shape warping for networked applications
Computer visualization and networking have advanced dramatically over the last few years, partially driven by the exploding video game market. 3D hardware acceleration has reached...
Alexander Repenning, Andri Ioannidou