Sciweavers

455 search results - page 78 / 91
» Approximation Algorithms for Partial Covering Problems
Sort
View
FOCS
2009
IEEE
15 years 4 months ago
Faster Generation of Random Spanning Trees
In this paper, we set forth a new algorithm for generating approximately uniformly random spanning trees in undirected graphs. We show how to sample from a distribution that is wi...
Jonathan A. Kelner, Aleksander Madry
ICPR
2006
IEEE
15 years 10 months ago
Competitive Mixtures of Simple Neurons
We propose a competitive finite mixture of neurons (or perceptrons) for solving binary classification problems. Our classifier includes a prior for the weights between different n...
Karthik Sridharan, Matthew J. Beal, Venu Govindara...
ICSM
2003
IEEE
15 years 3 months ago
Reverse Engineering of the Interaction Diagrams from C++ Code
In object oriented programming, the functionalities of a system result from the interactions (message exchanges) among the objects allocated by the system. While designing object ...
Paolo Tonella, Alessandra Potrich
IJRR
2000
121views more  IJRR 2000»
14 years 9 months ago
Reconstructing the Shape of a Deformable Membrane from Image Data
In this paper, we study the problem of determining a mathematical description of the surface defined by the shape of a membrane based on an image of it and present an algorithm fo...
Nicola J. Ferrier, Roger W. Brockett
MOBIHOC
2008
ACM
15 years 9 months ago
Strong barrier coverage of wireless sensor networks
Constructing sensor barriers to detect intruders crossing a randomly-deployed sensor network is an important problem. Early results have shown how to construct sensor barriers to ...
Benyuan Liu, Olivier Dousse, Jie Wang, Anwar Saipu...