Sciweavers

2030 search results - page 168 / 406
» Extremal Problems of Information Combining
Sort
View
CIKM
2010
Springer
15 years 4 months ago
On the selectivity of multidimensional routing indices
Recently, the problem of efficiently supporting advanced query operators, such as nearest neighbor or range queries, over multidimensional data in widely distributed environments...
Christos Doulkeridis, Akrivi Vlachou, Kjetil N&osl...
173
Voted
PERCOM
2011
ACM
14 years 9 months ago
Mobile node rostering in intermittently connected passive RFID networks
— This paper focuses on the problem of rostering in intermittently connected passive RFID networks. It aims to report a list of tagged mobile nodes that appear in given intereste...
Zhipeng Yang, Hongyi Wu
CDC
2010
IEEE
226views Control Systems» more  CDC 2010»
15 years 1 months ago
Fast primal-dual projected linear iterations for distributed consensus in constrained convex optimization
In this paper we study the constrained consensus problem, i.e. the problem of reaching a common point from the estimates generated by multiple agents that are constrained to lie in...
Ion Necoara, Ioan Dumitrache, Johan A. K. Suykens
NDQA
2003
119views Education» more  NDQA 2003»
15 years 7 months ago
Inference Web: Portable and Sharable Explanations for Question Answering
The World Wide Web lacks support for explaining information provenance. When web applications return results, many users do not know what information sources were used, when they ...
Deborah L. McGuinness, Paulo Pinheiro da Silva
PODC
2009
ACM
16 years 6 months ago
Brief announcement: global consistency can be easier than point-to-point communication
Global consistency or Byzantine Agreement (BA) and reliable point-to-point communication are two of the most important and well-studied problems in distributed computing. Informal...
Prasant Gopal, Anuj Gupta, Pranav K. Vasishta, Piy...