Sciweavers

1033 search results - page 140 / 207
» The Relative History Heuristic
Sort
View
AWIC
2003
Springer
15 years 5 months ago
From Search Engines to Question-Answering Systems - The Need for New Tools
Abstract Search engines, with Google at the top, have many remarkable capabilities. But what is not among them is the deduction capability—the capability to synthesize an answer ...
Lotfi A. Zadeh
COCOON
2003
Springer
15 years 5 months ago
Graph Coloring and the Immersion Order
The relationship between graph coloring and the immersion order is considered. Vertex connectivity, edge connectivity and related issues are explored. These lead to the conjecture...
Faisal N. Abu-Khzam, Michael A. Langston
FCT
2003
Springer
15 years 5 months ago
Graph Searching, Elimination Trees, and a Generalization of Bandwidth
The bandwidth minimization problem has a long history and a number of practical applications. In this paper we introduce a natural extension of bandwidth to partially ordered layo...
Fedor V. Fomin, Pinar Heggernes, Jan Arne Telle
ISCA
2010
IEEE
181views Hardware» more  ISCA 2010»
15 years 5 months ago
ColorSafe: architectural support for debugging and dynamically avoiding multi-variable atomicity violations
In this paper, we propose ColorSafe, an architecture that detects and dynamically avoids single- and multi-variable atomicity violation bugs. The key idea is to group related data...
Brandon Lucia, Luis Ceze, Karin Strauss
FOCS
2002
IEEE
15 years 4 months ago
On the (non)Universality of the One-Time Pad
Randomization is vital in cryptography: secret keys should be randomly generated and most cryptographic primitives (e.g., encryption) must be probabilistic. As a bstraction, it is...
Yevgeniy Dodis, Joel Spencer