1299 search results - page 129 / 260 » Computing Minimal Diagnoses with Critical Set Algorithms |
NIPS
2001
14 years 11 months ago
2001
Abstract--Kernel-based algorithms such as support vector machines have achieved considerable success in various problems in batch setting, where all of the training data is availab...
ICCAD
2003
IEEE
15 years 6 months ago
2003
IEEE
Routing for FPGAs has been a very challenging problem due to the limitation of routing resources. Although the FPGA routing problem has been researched extensively, most algorithm...
VIS
2007
IEEE
15 years 11 months ago
2007
IEEE
Abstract--We present a method to extract and visualize vortices that originate from bounding walls of three-dimensional timedependent flows. These vortices can be detected using th...
103
click to vote
DRR
2008
14 years 11 months ago
2008
Word segmentation is the most critical pre-processing step for any handwritten document recognition/retrieval system. This paper describes an approach to separate a line of uncons...
DAC
1989
ACM
15 years 2 months ago
1989
ACM
: We discuss a new approach to constructing the rectilinear Steiner tree (RST) of a given set of points in the plane, starting from a minimum spanning tree (MST). The main idea in ...