6202 search results - page 1175 / 1241 » Without Loss of Generality |
136
Voted
JUCS
2006
15 years 3 months ago
2006
: Bisimulation can be defined in a simple way using coinductive methods, and has rather pleasant properties. Ready similarity was proposed by Meyer et al. as a way to weakening the...
167
click to vote
EOR
2007
15 years 3 months ago
2007
The two-dimensional orthogonal non-guillotine cutting problem (NGCP) appears in many industries (like wood and steel industries) and consists in cutting a rectangular master surfa...
166
Voted
MST
2006
15 years 3 months ago
2006
Load balancing is a critical issue for the efficient operation of peerto-peer networks. We give two new load-balancing protocols whose provable performance guarantees are within a...
136
Voted
SIGECOM
2008
ACM
15 years 3 months ago
2008
ACM
We provide tight information-theoretic lower bounds for the welfare maximization problem in combinatorial auctions. In this problem, the goal is to partition m items among k bidde...
150
Voted
SIGIR
2008
ACM
15 years 3 months ago
2008
ACM
This work presents the use of click graphs in improving query intent classifiers, which are critical if vertical search and general-purpose search services are to be offered in a ...