Sciweavers

13457 search results - page 119 / 2692
» Can we elect if we cannot compare
Sort
View
ESA
2003
Springer
100views Algorithms» more  ESA 2003»
14 years 2 months ago
Multi-player and Multi-round Auctions with Severely Bounded Communication
We study auctions in which bidders have severe constraints on the size of messages they are allowed to send to the auctioneer. In such auctions, each bidder has a set of k possible...
Liad Blumrosen, Noam Nisan, Ilya Segal
KDD
2001
ACM
216views Data Mining» more  KDD 2001»
14 years 9 months ago
The distributed boosting algorithm
In this paper, we propose a general framework for distributed boosting intended for efficient integrating specialized classifiers learned over very large and distributed homogeneo...
Aleksandar Lazarevic, Zoran Obradovic
ISCA
2008
IEEE
137views Hardware» more  ISCA 2008»
14 years 3 months ago
Self-Optimizing Memory Controllers: A Reinforcement Learning Approach
Efficiently utilizing off-chip DRAM bandwidth is a critical issue in designing cost-effective, high-performance chip multiprocessors (CMPs). Conventional memory controllers deli...
Engin Ipek, Onur Mutlu, José F. Martí...
ECCV
2010
Springer
14 years 2 months ago
Energy Minimization Under Constraints on Label Counts
Abstract. Many computer vision problems such as object segmentation or reconstruction can be formulated in terms of labeling a set of pixels or voxels. In certain scenarios, we may...
CGI
2006
IEEE
14 years 23 days ago
Feature Sensitive Out-of-Core Chartification of Large Polygonal Meshes
Mesh chartification is an important tool for processing meshes in various applications. In this paper, we present a novel feature sensitive mesh chartification technique that can h...
Sungyul Choe, Minsu Ahn, Seungyong Lee