1241 search results - page 143 / 249 » Prolog Server Pages |
147
click to vote
PODC
2006
ACM
15 years 10 months ago
2006
ACM
Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...
144
Voted
PODC
2006
ACM
15 years 10 months ago
2006
ACM
Motivated by applications to sensor, peer-to-peer, and adhoc networks, we study the problem of computing functions of values at the nodes in a network in a totally distributed man...
137
click to vote
SAC
2006
ACM
15 years 10 months ago
2006
ACM
Structured data and complex schemas are becoming the main way to represent the information many Digital Libraries provide, thus impacting the services they offer. When searching i...
155
Voted
SASN
2006
ACM
15 years 10 months ago
2006
ACM
We present a novel outlier elimination technique designed for sensor networks. This technique is called RANBAR and it is based on the RANSAC (RANdom SAmple Consensus) paradigm, wh...
156
click to vote
SCESM
2006
ACM
15 years 10 months ago
2006
ACM
An important step in the development of large-scale distributed reactive systems is the design of effective system architectures. The early availability of prototypes facilitates...