3630 search results - page 378 / 726 » Fast Marching Methods |
140
click to vote
ICCAD
1997
IEEE
15 years 9 months ago
1997
IEEE
In many veri cation techniques fast functional evaluation of a Boolean network is needed. We investigate the idea of using Binary Decision Diagrams BDDs for functional simulatio...
138
click to vote
AAAI
2008
15 years 7 months ago
2008
This work addresses the problem of in-the-dark traffic classification for TCP sessions, an important problem in network management. An innovative use of support vector machines (S...
141
click to vote
BILDMED
2008
15 years 6 months ago
2008
We propose a method, which treats metal artifact reduction in CT by sinogram restoration as a problem of scattered data interpolation. Corrupted sinogram entries are discarded and ...
137
click to vote
NIPS
2008
15 years 6 months ago
2008
This paper examines the generalization properties of online convex programming algorithms when the loss function is Lipschitz and strongly convex. Our main result is a sharp bound...
142
click to vote
NIPS
2007
15 years 6 months ago
2007
To accelerate the training of kernel machines, we propose to map the input data to a randomized low-dimensional feature space and then apply existing fast linear methods. The feat...