16883 search results - page 2901 / 3377 » Generalized Non-Reducible Descriptors |
208
click to vote
PODC
2006
ACM
16 years 1 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...
195
click to vote
PODC
2006
ACM
16 years 1 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...
240
click to vote
PPOPP
2006
ACM
16 years 1 months ago
2006
ACM
Applications need to become more concurrent to take advantage of the increased computational power provided by chip level multiprocessing. Programmers have traditionally managed t...
168
click to vote
PPPJ
2006
ACM
16 years 1 months ago
2006
ACM
In Java programs, classes are coupled to each other through the use of typed references. In order to minimize coupling without changing the executed code, interfaces can be introd...
223
click to vote
SAC
2006
ACM
16 years 1 months ago
2006
ACM
Traditional semantic web query languages support a logicbased access to the semantic web. They offer a retrieval (or reasoning) of data based on facts. On the traditional web and...