Sciweavers

13414 search results - page 2456 / 2683
» The distributed boosting algorithm
Sort
View
MOBIHOC
2004
ACM
16 years 6 months ago
Rate allocation in wireless sensor networks with network lifetime requirement
An important performance consideration for wireless sensor networks is the amount of information collected by all the nodes in the network over the course of network lifetime. Sin...
Yiwei Thomas Hou, Yi Shi, Hanif D. Sherali
WSDM
2010
ACM
213views Data Mining» more  WSDM 2010»
16 years 3 months ago
Corroborating Information from Disagreeing Views
We consider a set of views stating possibly conflicting facts. Negative facts in the views may come, e.g., from functional dependencies in the underlying database schema. We want ...
Alban Galland, Serge Abiteboul, Amélie Mari...
WSDM
2010
ACM
245views Data Mining» more  WSDM 2010»
16 years 3 months ago
Improving Quality of Training Data for Learning to Rank Using Click-Through Data
In information retrieval, relevance of documents with respect to queries is usually judged by humans, and used in evaluation and/or learning of ranking functions. Previous work ha...
Jingfang Xu, Chuanliang Chen, Gu Xu, Hang Li, Elbi...
SODA
2010
ACM
190views Algorithms» more  SODA 2010»
16 years 3 months ago
One-Counter Markov Decision Processes
We study the computational complexity of some central analysis problems for One-Counter Markov Decision Processes (OC-MDPs), a class of finitely-presented, countable-state MDPs. O...
Tomas Brazdil, Vaclav Brozek, Kousha Etessami, Ant...
ICS
2010
Tsinghua U.
16 years 3 months ago
Non-Malleable Codes
We introduce the notion of "non-malleable codes" which relaxes the notion of error-correction and errordetection. Informally, a code is non-malleable if the message cont...
Stefan Dziembowski, Krzysztof Pietrzak, Daniel Wic...
« Prev « First page 2456 / 2683 Last » Next »