Sciweavers

27692 search results - page 114 / 5539
» Where is ...
Sort
View
99
Voted
ICML
2006
IEEE
16 years 3 months ago
Learning algorithms for online principal-agent problems (and selling goods online)
In a principal-agent problem, a principal seeks to motivate an agent to take a certain action beneficial to the principal, while spending as little as possible on the reward. This...
Vincent Conitzer, Nikesh Garera
84
Voted
RECOMB
2001
Springer
16 years 2 months ago
Algorithms for phylogenetic footprinting
Phylogenetic footprinting is a comparative genomics approach for predicting transcription factor binding sites, where a set of orthologous regulatory regions are compared and short...
Mathieu Blanchette
130
Voted
STOC
2006
ACM
132views Algorithms» more  STOC 2006»
16 years 2 months ago
Near-optimal algorithms for unique games
Unique games are constraint satisfaction problems that can be viewed as a generalization of Max-Cut to a larger domain size. The Unique Games Conjecture states that it is hard to ...
Moses Charikar, Konstantin Makarychev, Yury Makary...
116
Voted
STOC
2004
ACM
134views Algorithms» more  STOC 2004»
16 years 2 months ago
Approximate max-integral-flow/min-multicut theorems
We establish several approximate max-integral-flow / minmulticut theorems. While in general this ratio can be very large, we prove strong approximation ratios in the case where th...
Kenji Obata
117
Voted
PERCOM
2005
ACM
16 years 1 months ago
Mobile data collection in sensor networks: The TinyLime
In this paper we describe TinyLime, a novel middleware for wireless sensor networks that departs from the traditional setting where sensor data is collected by a central monitorin...
Carlo Curino, Matteo Giani, Marco Giorgetta, Aless...