Sciweavers

123 search results - page 20 / 25
» A Simple and Effective Edge Detector
Sort
View
SODA
1998
ACM
99views Algorithms» more  SODA 1998»
13 years 9 months ago
Online Throughput-Competitive Algorithm for Multicast Routing and Admission Control
We present the first polylog-competitive online algorithm for the general multicast admission control and routing problem in the throughput model. The ratio of the number of reque...
Ashish Goel, Monika Rauch Henzinger, Serge A. Plot...
TCS
2008
13 years 7 months ago
The role of information in the cop-robber game
We investigate the role of the information available to the players on the outcome of the cops and robbers game. This game takes place on a graph and players move along the edges ...
Volkan Isler, Nikhil Karnad
IVC
2007
124views more  IVC 2007»
13 years 7 months ago
Outlier rejection in high-dimensional deformable models
Deformable model tracking is a powerful methodology that allows us to track the evolution of high-dimensional parameter vectors from uncalibrated monocular video sequences. The co...
Christian Vogler, Siome Goldenstein, Jorge Stolfi,...
PVLDB
2010
149views more  PVLDB 2010»
13 years 6 months ago
GRAIL: Scalable Reachability Index for Large Graphs
Given a large directed graph, rapidly answering reachability queries between source and target nodes is an important problem. Existing methods for reachability trade-off indexing ...
Hilmi Yildirim, Vineet Chaoji, Mohammed Javeed Zak...
CGF
2011
12 years 11 months ago
Contouring Discrete Indicator Functions
We present a method for calculating the boundary of objects from Discrete Indicator Functions that store 2material volume fractions with a high degree of accuracy. Although Marchi...
Josiah Manson, J. Smith, Scott Schaefer