1656 search results - page 200 / 332 » Labeling Schemes with Queries |
DAC
2008
ACM
14 years 9 months ago
2008
ACM
Pattern matching relies on deterministic finite automata (DFA) to search for predefined patterns. While a bit-DFA method is recently proposed to exploit the parallelism in pattern...
ICML
2004
IEEE
14 years 8 months ago
2004
IEEE
In this paper we focus on the adaptation of boosting to grammatical inference. We aim at improving the performances of state merging algorithms in the presence of noisy data by us...
AIHC
2007
Springer
14 years 2 months ago
2007
Springer
Automatic multimodal recognition of spontaneous emotional expressions is a largely unexplored and challenging problem. In this paper, we explore audio-visual emotion recognition in...
WEA
2007
Springer
14 years 2 months ago
2007
Springer
The Balanced Subgraph problem (edge deletion variant) asks for a 2-coloring of a graph that minimizes the inconsistencies with given edge labels. It has applications in social netw...
SPAA
2005
ACM
14 years 1 months ago
2005
ACM
A weighted undirected network is ∆ growth-bounded if the number of nodes at distance 2r around any given node is at most ∆ times the number of nodes at distance r around the n...