1757 search results - page 30 / 352 » Alternating Refinement Relations |
93
Voted
MST
1998
15 years 4 days ago
1998
We de ne the sharply bounded hierarchy, SBH(QL), a hierarchy of classes within P, using quasilinear-time computation and quanti cation over strings of length logn. It generalizes ...
104
Voted
ICML
1999
IEEE
16 years 1 months ago
1999
IEEE
The applicationofboosting procedures to decision tree algorithmshas been shown to produce very accurate classi ers. These classiers are in the form of a majority vote over a numbe...
109
click to vote
COCO
2003
Springer
15 years 5 months ago
2003
Springer
We give machine characterisations and logical descriptions of a number of parameterized complexity classes. The focus of our attention is the class W[P], which we characterise as ...
111
click to vote
ACL
2006
15 years 1 months ago
2006
The integration of sophisticated inference-based techniques into natural language processing applications first requires a reliable method of encoding the predicate-argument struc...
115
click to vote
CSSE
2002
IEEE
2002
IEEE
Characteristics of assured service and an alternative RIO scheme in differentiated services networks
15 years 8 days ago
Assured Service, a service model of Internet Differentiated Services (DiffServ) architecture, is not so well accommodated by the current Internet environment. This is because the I...