1897 search results - page 286 / 380 » Sparse Additive Machine |
106
click to vote
SIGIR
2005
ACM
15 years 6 months ago
2005
ACM
We describe a method for predicting query difficulty in a precision-oriented web search task. Our approach uses visual features from retrieved surrogate document representations (...
104
Voted
ATVA
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. This paper argues that flatness appears as a central notion in the verification of counter automata. A counter automaton is called flat when its control graph can be ...
126
Voted
CCS
2005
ACM
15 years 6 months ago
2005
ACM
An optimistic acknowledgment (opt-ack) is an acknowledgment sent by a misbehaving client for a data segment that it has not received. Whereas previous work has focused on opt-ack ...
117
Voted
COCOON
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. The original definition of P-systems calls for rules to be applied in a maximally parallel fashion. However, in some cases a sequential model may be a more reasonable as...
113
click to vote
CP
2005
Springer
15 years 6 months ago
2005
Springer
Many problems used in AI planning including Blocks, Logistics, Gripper, Satellite, and others lack the interactions that characterize puzzles and can be solved nonoptimally in low...