2218 search results - page 11 / 444 » Testing Expressibility Is Hard |
WCE
2007
13 years 8 months ago
2007
- The purpose of this research paper is to study the tool wear and surface roughness of AISI 8620 material using coated ceramic tool by turning process. Ceramic cutting tools have ...
ICPR
2006
IEEE
14 years 8 months ago
2006
IEEE
We describe a new expression database which contains video sequences of both played and natural expressions and an expression classification system based on warped optical flow fi...
DATE
2009
IEEE
14 years 2 months ago
2009
IEEE
—Scheduling task graphs under hard (end-to-end) timing constraints is an extensively studied NP-hard problem of critical importance for predictable software mapping on Multiproce...
ISAAC
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Given two comparative maps, that is two sequences of markers each representing a genome, the Maximal Strip Recovery problem (MSR) asks to extract a largest sequence of ma...
MFCS
2007
Springer
14 years 1 months ago
2007
Springer
A tournament is a graph in which each pair of distinct vertices is connected by exactly one directed edge. Tournaments are an important graph class, for which isomorphism testing ...