3044 search results - page 170 / 609 » Linear logical approximations |
121
click to vote
ICASSP
2008
IEEE
15 years 10 months ago
2008
IEEE
In this paper, we propose a novel approach to feature compensation performed in the cepstral domain. We apply the linear approximation method in the cepstral domain to simplify th...
128
Voted
STOC
1998
ACM
15 years 7 months ago
1998
ACM
Given an undirected graph with edge costs and a subset of k nodes called terminals, a multiway cut is a subset of edges whose removal disconnects each terminal from the rest. Mult...
131
Voted
ESA
2006
Springer
15 years 7 months ago
2006
Springer
The objective of this paper is to characterize classes of problems for which a greedy algorithm finds solutions provably close to optimum. To that end, we introduce the notion of k...
114
click to vote
IJCAI
2003
15 years 4 months ago
2003
The computation of the first complete approximations of game-theoretic optimal strategies for fullscale poker is addressed. Several abstraction techniques are combined to represe...
109
click to vote
CCCG
1993
15 years 4 months ago
1993
d abstract) Gunter Rotey Christian Schwarzz Jack Snoeyinkx The width of a set of n points in the plane is the smallest distance between two parallel lines that enclose the set. W...