Sciweavers

6897 search results - page 1160 / 1380
» Parallelization of Modular Algorithms
Sort
View
AAAI
2008
15 years 9 months ago
Minimizing Disk I/O in Two-Bit Breadth-First Search
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...
Richard E. Korf
161
Voted
ATAL
2008
Springer
15 years 9 months ago
Incorporating user utility into sponsored-search auctions
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...
Yagil Engel, David Maxwell Chickering
180
Voted
ASPDAC
2005
ACM
109views Hardware» more  ASPDAC 2005»
15 years 9 months ago
Fault tolerant nanoelectronic processor architectures
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...
Wenjing Rao, Alex Orailoglu, Ramesh Karri
191
Voted
COSIT
2007
Springer
103views GIS» more  COSIT 2007»
15 years 8 months ago
Scale-Dependent Simplification of 3D Building Models Based on Cell Decomposition and Primitive Instancing
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-...
Martin Kada
196
Voted
ACL
2008
15 years 8 months ago
Inducing Gazetteers for Named Entity Recognition by Large-Scale Clustering of Dependency Relations
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...
Jun'ichi Kazama, Kentaro Torisawa
« Prev « First page 1160 / 1380 Last » Next »