Sciweavers

21 search results - page 3 / 5
» A sequential sampling algorithm for a general class of utili...
Sort
View
SODA
2008
ACM
122views Algorithms» more  SODA 2008»
13 years 7 months ago
Fast approximation of the permanent for very dense problems
Approximation of the permanent of a matrix with nonnegative entries is a well studied problem. The most successful approach to date for general matrices uses Markov chains to appr...
Mark Huber, Jenny Law
WCC
2005
Springer
130views Cryptology» more  WCC 2005»
13 years 11 months ago
On the Design of Codes for DNA Computing
In this paper, we describe a broad class of problems arising in the context of designing codes for DNA computing. We primarily focus on design considerations pertaining to the phen...
Olgica Milenkovic, Navin Kashyap
WSC
2004
13 years 7 months ago
XML-Based Supply Chain Simulation Modeling
We describe a different approach to using XML to support the simulation modeling of supply chains. Instead of using XML to specify the simulation constructs, as most previous appr...
Dean C. Chatfield, Terry P. Harrison, Jack C. Hayy...
ICASSP
2010
IEEE
13 years 6 months ago
Semi-Supervised Fisher Linear Discriminant (SFLD)
Supervised learning uses a training set of labeled examples to compute a classifier which is a mapping from feature vectors to class labels. The success of a learning algorithm i...
Seda Remus, Carlo Tomasi
GD
2005
Springer
13 years 11 months ago
Drawing Graphs Using Modular Decomposition
Abstract. In this paper we present an algorithm for drawing an undirected graph G which takes advantage of the structure of the modular decomposition tree of G. Specifically, our ...
Charis Papadopoulos, Constantinos Voglis