6142 search results - page 679 / 1229 » The Complexity of Partition Functions |
205
click to vote
KCAP
2009
ACM
15 years 11 months ago
2009
ACM
Ontology modularization has received growing interest from the research community lately, since it supports tasks such as ontology design/reuse and knowledge selection and integra...
204
click to vote
FSTTCS
2009
Springer
15 years 11 months ago
2009
Springer
We introduce a graph clustering problem motivated by a stream processing application. Input to our problem is an undirected graph with vertex and edge weights. A cluster is a subse...
204
click to vote
ICCCN
1998
IEEE
15 years 11 months ago
1998
IEEE
An important issue in the design of future Personal Communication Services (PCS) networks is the efficient management of location information. The current IS-41 standard P C S arc...
206
click to vote
SIGADA
1999
Springer
15 years 11 months ago
1999
Springer
In this paper we will demonstrate how Ada and its Distributed Annex may be used to relocate concurrent objects in a distributed data ow application. This relocation mechanism will...
172
click to vote
VLDB
1998
ACM
15 years 11 months ago
1998
ACM
The problem of finding an optimal bipartition of a rectangle set has a direct impact on query performance of dynamic R-trees. During update operations, overflowed nodes need to be...