Sciweavers

2745 search results - page 146 / 549
» A fast algorithm for computing large Fibonacci numbers
Sort
View
SDM
2011
SIAM
232views Data Mining» more  SDM 2011»
14 years 6 months ago
A Sequential Dual Method for Structural SVMs
In many real world prediction problems the output is a structured object like a sequence or a tree or a graph. Such problems range from natural language processing to computationa...
Shirish Krishnaj Shevade, Balamurugan P., S. Sunda...
BMCBI
2007
151views more  BMCBI 2007»
15 years 4 months ago
Minimus: a fast, lightweight genome assembler
Background: Genome assemblers have grown very large and complex in response to the need for algorithms to handle the challenges of large whole-genome sequencing projects. Many of ...
Daniel D. Sommer, Arthur L. Delcher, Steven L. Sal...
ICCAD
1994
IEEE
76views Hardware» more  ICCAD 1994»
15 years 8 months ago
An efficient procedure for the synthesis of fast self-testable controller structures
The BIST implementation of a conventionally synthesized controller in most cases requires the integration of an additional register only for test purposes. This leads to some seri...
Sybille Hellebrand, Hans-Joachim Wunderlich
SMA
2008
ACM
396views Solid Modeling» more  SMA 2008»
15 years 3 months ago
Fast mesh segmentation using random walks
3D mesh models are now widely available for use in various applications. The demand for automatic model analysis and understanding is ever increasing. Mesh segmentation is an impo...
Yu-Kun Lai, Shi-Min Hu, Ralph R. Martin, Paul L. R...
157
Voted
ICIAR
2010
Springer
15 years 1 months ago
Image Segmentation for Robots: Fast Self-adapting Gaussian Mixture Model
Image segmentation is a critical low-level visual routine for robot perception. However, most image segmentation approaches are still too slow to allow real-time robot operation. I...
Nicola Greggio, Alexandre Bernardino, José ...