99 search results - page 6 / 20 » RNC Algorithms for the Uniform Generation of Combinatorial S... |
JDA
2006
13 years 7 months ago
2006
In this paper, we survey fully dynamic algorithms for path problems on general directed graphs. In particular, we consider two fundamental problems: dynamic transitive closure and...
WWW
2008
ACM
14 years 8 months ago
2008
ACM
Most current banner advertising is sold through negotiation thereby incurring large transaction costs and possibly suboptimal allocations. We propose a new automated system for se...
RECOMB
2010
Springer
13 years 5 months ago
2010
Springer
Chaining fragments is a crucial step in genome alignment. Existing chaining algorithms compute a maximum weighted chain with no overlaps allowed between adjacent fragments. In prac...
DCG
2008
13 years 7 months ago
2008
Two-dimensional constrained Delaunay triangulations are geometric structures that are popular for interpolation and mesh generation because they respect the shapes of planar domai...
NIPS
1994
13 years 8 months ago
1994
Many real world learning problems are best characterized by an interaction of multiple independent causes or factors. Discovering such causal structure from the data is the focus ...