We present a breadth-first search algorithm, two-bit breadthfirst search (TBBFS), which requires only two bits for each state in the problem space. TBBFS can be parallelized in se...
We study principled methods for incorporating user utility into the selection of sponsored search ads. We describe variations of the GSP allocation/pricing mechanism that accommod...
In this paper we propose a fault-tolerant processor architecture and an associated fault-tolerant computation model capable of fault tolerance in the nanoelectronic environment th...
Abstract. The paper proposes a novel approach for a scale-dependent geometric simplification of 3D building models that are an integral part of virtual cities. In contrast to real-...
We propose using large-scale clustering of dependency relations between verbs and multiword nouns (MNs) to construct a gazetteer for named entity recognition (NER). Since dependen...