1532 search results - page 88 / 307 » Connection Relations in Mereotopology |
COCOON
2003
Springer
15 years 3 months ago
2003
Springer
Abstract. We show that finding roots of Boolean matrices is an NPhard problem. This answers a twenty year old question from semigroup theory. Interpreting Boolean matrices as dire...
COCO
1991
Springer
15 years 1 months ago
1991
Springer
Abstract Rafail Ostrovskyy MIT Laboratory for Computer Science 545 Technology Square, Cambridge, MA 02139 In this paper, we study connections among one-way functions, hard on the ...
ACL
2007
14 years 11 months ago
2007
This paper describes a new method for computing lexical chains. These are sequences of semantically related words that reflect a text’s cohesive structure. In contrast to previo...
ECIS
2004
14 years 11 months ago
2004
Recent advances in technical capabilities have facilitated an increase in the reach and range of the connectivity of Information and Communications Technologies (ICTs). It is prop...
104
click to vote
ALGORITHMICA
2006
14 years 10 months ago
2006
Dai, Li, and Wu proposed Rule k, a localized approximation algorithm that attempts to find a small connected dominating set in a graph. In this paper we consider the "average...