773 search results - page 117 / 155 » Traversing the Machining Graph |
SIGECOM
2010
ACM
15 years 2 months ago
2010
ACM
We study the design of truthful mechanisms that do not use payments for the generalized assignment problem (GAP) and its variants. An instance of the GAP consists of a bipartite g...
COLT
1993
Springer
15 years 1 months ago
1993
Springer
We describe three applications in computational learning theory of techniques and ideas recently introduced in the study of parameterized computational complexity. (1) Using param...
MLG
2007
Springer
15 years 3 months ago
2007
Springer
1 In web-related applications of image categorization, it is desirable to derive an interpretable classification rule with high accuracy. Using the bag-of-words representation and...
78
Voted
INTERNET
2007
14 years 9 months ago
2007
evel of abstraction, we can represent a workflow as a directed graph with operators (or tasks) at the vertices (see Figure 1). Each operator takes inputs from data sources or from ...
190
Voted
ICDE
2008
IEEE
15 years 11 months ago
2008
IEEE
Linear Discriminant Analysis (LDA) has been a popular method for extracting features which preserve class separability. It has been widely used in many fields of information proces...