Sciweavers

1816 search results - page 199 / 364
» A New Approach for Solving the Maximum Clique Problem
Sort
View
ECML
2007
Springer
16 years 22 days ago
Discriminative Sequence Labeling by Z-Score Optimization
Abstract. We consider a new discriminative learning approach to sequence labeling based on the statistical concept of the Z-score. Given a training set of pairs of hidden-observed ...
Elisa Ricci, Tijl De Bie, Nello Cristianini
ICMCS
2006
IEEE
105views Multimedia» more  ICMCS 2006»
16 years 18 days ago
Web based Chinese Calligraphy Learning with 3-D Visualization Method
Chinese calligraphy is pictographic and each calligraphist has his own writing style. People often feel difficult in writing a demanded beautiful calligraphy style. In order to he...
Yingfei Wu, Yueting Zhuang, Yunhe Pan, Jiangqin Wu
CP
2005
Springer
16 years 3 days ago
Tree Decomposition with Function Filtering
Besides search, complete inference methods can also be used to solve soft constraint problems. Their main drawback is the high spatial complexity. To improve its practical usage, w...
Martí Sánchez, Javier Larrosa, Pedro...
ICML
2000
IEEE
15 years 11 months ago
Lightweight Rule Induction
We propose a new rule induction algorithm for solving classification problems via probability estimation. The main advantage of decision rules is their simplicity and good interp...
Sholom M. Weiss, Nitin Indurkhya
DAC
1997
ACM
15 years 10 months ago
An Improved Algorithm for Minimum-Area Retiming
The concept of improving the timing behavior of a circuit by relocating flip-flops is called retiming and was first presented by Leiserson and Saxe. The ASTRA algorithm propose...
Naresh Maheshwari, Sachin S. Sapatnekar