900 search results - page 172 / 180 » On Polynomial Time Computation over Unordered Structures |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
The neighbourhood function NG(t) of a graph G gives, for each t ∈ N, the number of pairs of nodes x, y such that y is reachable from x in less that t hops. The neighbourhood fun...
WWW
2009
ACM
14 years 9 months ago
2009
ACM
Much of the information on the Web is found in articles from online news outlets, magazines, encyclopedias, review collections, and other sources. However, extracting this content...
RTSS
2008
IEEE
14 years 3 months ago
2008
IEEE
This paper presents the design of user-level scheduling hierarchies in the Composite component-based system. The motivation for this is centered around the design of a system that...
DCOSS
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. We develop a practical, distributed algorithm to detect events, identify measurement errors, and infer missing readings in ecological applications of wireless sensor netw...
JAIR
2006
13 years 8 months ago
2006
In a field of research about general reasoning mechanisms, it is essential to have appropriate benchmarks. Ideally, the benchmarks should reflect possible applications of the deve...