231 search results - page 7 / 47 » Selection of Optimal Rule Refinements |
114
Voted
ISPD
1999
ACM
15 years 8 months ago
1999
ACM
—Maze routing algorithms are widely used for finding an optimal path in detailed routing for very large scale integration, printed circuit board and multichip modules In this pap...
124
Voted
SIGCOMM
2010
ACM
15 years 3 months ago
2010
ACM
Packet Classification is a key functionality provided by modern routers. Previous decision-tree algorithms, HiCuts and HyperCuts, cut the multi-dimensional rule space to separate ...
123
Voted
ICMCS
2007
IEEE
15 years 7 months ago
2007
IEEE
The Lagrangian multiplier based rate-distortion optimization has been proved to be an effective way in hybrid video coding. In this paper, an advanced Lagrange multiplier selectio...
242
Voted
ICDE
2000
IEEE
16 years 5 months ago
2000
IEEE
Optimizing queries that involve operations on spatial data requires estimating the selectivity and cost of these operations. In this paper, we focus on estimating the cost of spat...
143
Voted
AAAI
2012
13 years 6 months ago
2012
Distance rationalizability is an intuitive paradigm for developing and studying voting rules: given a notion of consensus and a distance function on preference profiles, a ration...