Sciweavers

303 search results - page 33 / 61
» Discrete Mathematics for Computer Science, Some Notes
Sort
View
FOCS
2007
IEEE
15 years 4 months ago
Adaptive Simulated Annealing: A Near-optimal Connection between Sampling and Counting
We present a near-optimal reduction from approximately counting the cardinality of a discrete set to approximately sampling elements of the set. An important application of our wo...
Daniel Stefankovic, Santosh Vempala, Eric Vigoda
TOMACS
2010
182views more  TOMACS 2010»
14 years 8 months ago
State-dependent importance sampling for a Jackson tandem network
This paper considers importance sampling as a tool for rare-event simulation. The focus is on estimating the probability of overflow in the downstream queue of a Jacksonian two-n...
Denis I. Miretskiy, Werner R. W. Scheinhardt, Mich...
ECCV
2002
Springer
15 years 11 months ago
Probabilistic Search for Object Segmentation and Recognition
Abstract. The problem of searching for a model-based scene interpretation is analyzed within a probabilistic framework. Object models are formulated as generative models for range ...
Ulrich Hillenbrand, Gerd Hirzinger
MOBICOM
2006
ACM
15 years 3 months ago
On the complexity of scheduling in wireless networks
We consider the problem of throughput-optimal scheduling in wireless networks subject to interference constraints. We model the interference using a family of K-hop interference m...
Gaurav Sharma, Ravi R. Mazumdar, Ness B. Shroff
VISUALIZATION
2005
IEEE
15 years 3 months ago
Visualizing the tightening of knots
The study of physical models for knots has recently received much interest in the mathematics community. In this paper, we consider the ropelength model, which considers knots tie...
Jason Cantarella, Michael Piatek, Eric Rawdon