44 search results - page 8 / 9 » Basis Reduction, and the Complexity of Branch-and-Bound |
ICPR
2000
IEEE
13 years 9 months ago
2000
IEEE
JKanji is an interactive character completion system that provides stroke-order-independent recognition of complex hand-written glyphs such as Japanese kanji or Chinese hanzi. As ...
ASPDAC
1998
ACM
13 years 9 months ago
1998
ACM
Binary decision diagrams (BDDs) have been shown to be a powerful tool in formal verification. Efficient BDD construction techniques become more important as the complexity of proto...
ICMLA
2007
13 years 6 months ago
2007
Optimal Component Analysis (OCA) is a linear method for feature extraction and dimension reduction. It has been widely used in many applications such as face and object recognitio...
APCCM
2009
13 years 6 months ago
2009
Service-oriented architectures (SOAs) provide the basis of distributed application frameworks where software components are provided as modular and reusable services. Until today ...
DATAMINE
2010
13 years 5 months ago
2010
We address the combinatorial optimization problem of finding the most influential nodes on a large-scale social network for two widely-used fundamental stochastic diffusion models...