Sciweavers

1656 search results - page 21 / 332
» Labeling Schemes with Queries
Sort
View
LICS
2003
IEEE
14 years 28 days ago
Labelled Markov Processes: Stronger and Faster Approximations
This paper reports on and discusses three notions of approximation for Labelled Markov Processes that have been developed last year. The three schemes are improvements over former...
Vincent Danos, Josee Desharnais
WWW
2007
ACM
14 years 8 months ago
Identifying ambiguous queries in web search
It is widely believed that some queries submitted to search engines are by nature ambiguous (e.g., java, apple). However, few studies have investigated the questions of "how ...
Ruihua Song, Zhenxiao Luo, Ji-Rong Wen, Yong Yu, H...
COLT
2004
Springer
13 years 11 months ago
Minimizing Regret with Label Efficient Prediction
We investigate label efficient prediction, a variant, proposed by Helmbold and Panizza, of the problem of prediction with expert advice. In this variant, the forecaster, after gues...
Nicolò Cesa-Bianchi, Gábor Lugosi, G...
NAS
2010
IEEE
13 years 6 months ago
Label-Based DV-Hop Localization Against Wormhole Attacks in Wireless Sensor Networks
Node localization becomes an important issue in the wireless sensor network as its broad applications in environment monitoring, emergency rescue and battlefield surveillance, et...
Junfeng Wu, Honglong Chen, Wei Lou, Zhibo Wang, Zh...
ICDCN
2009
Springer
14 years 2 months ago
Compact Routing Schemes for Dynamic Trees in the Fixed Port Model
Abstract. The current paper considers the routing problem in dynamic trees under the fixed-port model, in which an adversary chooses the port numbers assigned to each node. We pre...
Amos Korman