6167 search results - page 971 / 1234 » Can Refinement be Automated |
103
click to vote
CIKM
2007
Springer
15 years 7 months ago
2007
Springer
Several problems in text categorization are too hard to be solved by standard bag-of-words representations. Work in kernel-based learning has approached this problem by (i) consid...
83
Voted
CP
2007
Springer
15 years 7 months ago
2007
Springer
Visualization is often invaluable to understand the behavior of optimization algorithms, identify their bottlenecks or pathological behaviors, and suggest remedial techniques. Yet ...
76
Voted
CSL
2007
Springer
15 years 7 months ago
2007
Springer
Models of the untyped λ-calculus may be defined either as applicative structures satisfying a bunch of first order axioms, known as “λ-models”, or as (structures arising fr...
100
Voted
CSL
2007
Springer
15 years 7 months ago
2007
Springer
The Prover/Delayer game is a combinatorial game that can be used to prove upper and lower bounds on the size of Tree Resolution proofs, and also perfectly characterizes the space ...
109
Voted
DEXA
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. Sharing of structured data in decentralized environments is a challenging problem, especially in the absence of a global schema. Social network structures map network lin...