Sciweavers

696 search results - page 59 / 140
» A class of combinatorial identities
Sort
View
GECCO
2009
Springer
172views Optimization» more  GECCO 2009»
15 years 11 months ago
Comparison of similarity measures for the multi-objective vehicle routing problem with time windows
The Vehicle Routing Problem can be seen as a fusion of two well known combinatorial problems, the Travelling Salesman Problem and Bin Packing Problem. It has several variants, the...
Abel Garcia-Najera, John A. Bullinaria
CDC
2009
IEEE
158views Control Systems» more  CDC 2009»
15 years 10 months ago
Multiple target detection using Bayesian learning
In this paper, we study multiple target detection using Bayesian learning. The main aim of the paper is to present a computationally efficient way to compute the belief map update ...
Sujit Nair, Konda Reddy Chevva, Houman Owhadi, Jer...
EMMCVPR
2007
Springer
15 years 10 months ago
Efficient Shape Matching Via Graph Cuts
Abstract. Meaningful notions of distance between planar shapes typically involve the computation of a correspondence between points on one shape and points on the other. To determi...
Frank R. Schmidt, Eno Töppe, Daniel Cremers, ...
LREC
2008
111views Education» more  LREC 2008»
15 years 7 months ago
Low-Density Language Bootstrapping: the Case of Tajiki Persian
Low-density languages raise difficulties for standard approaches to natural language processing that depend on large online corpora. Using Persian as a case study, we propose a no...
Karine Megerdoomian, Dan Parvaz
IJCAI
2001
15 years 7 months ago
Robust Multi-unit Auction Protocol against False-name Bids
This paper presents a new multi-unit auction protocol (IR protocol) that is robust against false-name bids. Internet auctions have become an integral part of Electronic Commerce a...
Makoto Yokoo, Yuko Sakurai, Shigeo Matsubara