11 search results - page 2 / 3 » Simpler Parameterized Algorithm for OCT |
FSTTCS
2009
Springer
13 years 12 months ago
2009
Springer
Partial Cover problems are optimization versions of fundamental and well studied problems like Vertex Cover and Dominating Set. Here one is interested in covering (or dominating) ...
WADS
2005
Springer
13 years 10 months ago
2005
Springer
Spatial databases support a variety of geometric queries on point data such as range searches, nearest neighbor searches, etc. Balanced Aspect Ratio (BAR) trees are hierarchical sp...
CVPR
2008
IEEE
14 years 7 months ago
2008
IEEE
Learning a discriminant becomes substantially more difficult when the datasets are high-dimensional and the available samples are few. This is often the case in computer vision an...
ISVC
2007
Springer
13 years 11 months ago
2007
Springer
Visualization of glyphs has a long history in medical imaging but gains much more power when the glyphs are properly placed to fill the screen. Glyph packing is often performed vi...
CONCUR
2006
Springer
13 years 9 months ago
2006
Springer
Abstract. We present a new method for proving liveness and termination properties for fair concurrent programs, which does not rely on finding a ranking function or on computing th...