Sciweavers

3318 search results - page 323 / 664
» The Weak Instance Model
Sort
View
129
Voted
KBS
1998
66views more  KBS 1998»
15 years 4 months ago
Strategic knowledge in design: a compositional approach
In interactive design processes, strategic decisions are made at different levels. To support designers, design support systems need to include corresponding strategic knowledge at...
Frances M. T. Brazier, Pieter H. G. van Langen, Ja...
149
Voted
TCS
2010
15 years 3 months ago
A combinatorial approach to the analysis of bucket recursive trees
In this work we provide a combinatorial analysis of bucket recursive trees, which have been introduced previously as a natural generalization of the growth model of recursive trees...
Markus Kuba, Alois Panholzer
134
Voted
EMNLP
2009
15 years 2 months ago
Efficient kernels for sentence pair classification
In this paper, we propose a novel class of graphs, the tripartite directed acyclic graphs (tDAGs), to model first-order rule feature spaces for sentence pair classification. We in...
Fabio Massimo Zanzotto, Lorenzo Dell'Arciprete
124
Voted
AOR
2010
15 years 2 months ago
Sphere Methods for LP
The sphere method for solving linear programs operates with only a subset of constraints in the model in each iteration, and thus has the advantage of handling instances which may...
Katta G. Murty, Mohammad R. Oskoorouchi
141
Voted
COMPLEXITY
2010
120views more  COMPLEXITY 2010»
15 years 2 months ago
The complexity of partition tasks
In this paper we introduce the Partition Task problem class along with a complexity measure to evaluate its instances and a performance measure to quantify the ability of a system...
Fernando Eesponda, Matías Vera-Cruz, Jorge ...