Sciweavers

176 search results - page 20 / 36
» Optimal Sampling Strategies in Quicksort
Sort
View
GLVLSI
2006
IEEE
193views VLSI» more  GLVLSI 2006»
15 years 5 months ago
Optimizing noise-immune nanoscale circuits using principles of Markov random fields
As CMOS devices and operating voltages are scaled down, noise and defective devices will impact the reliability of digital circuits. Probabilistic computing compatible with CMOS o...
Kundan Nepal, R. Iris Bahar, Joseph L. Mundy, Will...
UAI
2004
15 years 1 months ago
Bidding under Uncertainty: Theory and Experiments
This paper describes a study of agent bidding strategies, assuming combinatorial valuations for complementary and substitutable goods, in three auction environments: sequential au...
Amy R. Greenwald, Justin A. Boyan
BMCBI
2008
166views more  BMCBI 2008»
14 years 11 months ago
Biclustering via optimal re-ordering of data matrices in systems biology: rigorous methods and comparative studies
Background: The analysis of large-scale data sets via clustering techniques is utilized in a number of applications. Biclustering in particular has emerged as an important problem...
Peter A. DiMaggio Jr., Scott R. McAllister, Christ...
CAD
2005
Springer
14 years 11 months ago
Optimizing the topological and combinatorial complexity of isosurfaces
Since the publication of the original Marching Cubes algorithm, numerous variations have been proposed for guaranteeing water-tight constructions of triangulated approximations of...
Carlos Andújar, Pere Brunet, Antoni Chica, ...
COMCOM
2008
120views more  COMCOM 2008»
14 years 11 months ago
Game theoretic models for detecting network intrusions
In this paper, we study using game theory the problem of detecting intrusions in wired infrastructure networks. Detection is accomplished by sampling a subset of the transmitted p...
Hadi Otrok, Mona Mehrandish, Chadi Assi, Mourad De...