Sciweavers

1648 search results - page 257 / 330
» Where to Build a Door
Sort
View
WINE
2010
Springer
164views Economy» more  WINE 2010»
15 years 4 months ago
Incentives in Online Auctions via Linear Programming
Online auctions in which items are sold in an online fashion with little knowledge about future bids are common in the internet environment. We study here a problem in which an auc...
Niv Buchbinder, Kamal Jain, Mohit Singh
ALENEX
2009
172views Algorithms» more  ALENEX 2009»
15 years 4 months ago
Rank Aggregation: Together We're Strong
We consider the problem of finding a ranking of a set of elements that is "closest to" a given set of input rankings of the elements; more precisely, we want to find a p...
Frans Schalekamp, Anke van Zuylen
ICC
2009
IEEE
171views Communications» more  ICC 2009»
15 years 4 months ago
IPsec-Based Anonymous Networking: A Working Implementation
Protecting users' privacy is becoming one of the rising issues for the success of future communications. The Internet in particular, with its open architecture, presents sever...
Csaba Király, Renato Lo Cigno
CIKM
2010
Springer
15 years 3 months ago
Regularization and feature selection for networked features
In the standard formalization of supervised learning problems, a datum is represented as a vector of features without prior knowledge about relationships among features. However, ...
Hongliang Fei, Brian Quanz, Jun Huan
TWC
2010
15 years 26 days ago
Dual-hop adaptive packet transmission systems with regenerative relaying
We propose and analyze two different approaches for performing adaptive modulation and coding (AMC) in dualhop transmission systems, where a source node S communicates with a certa...
Andreas Müller 0001, Hong-Chuan Yang