Sciweavers

1568 search results - page 52 / 314
» The problem of examination questions in algorithmics
Sort
View
73
Voted
CAV
2006
Springer
110views Hardware» more  CAV 2006»
15 years 1 months ago
Improving Pushdown System Model Checking
Abstract. In this paper, we reduce pushdown system (PDS) model checking to a graphtheoretic problem, and apply a fast graph algorithm to improve the running time for model checking...
Akash Lal, Thomas W. Reps
94
Voted
CORR
2011
Springer
156views Education» more  CORR 2011»
14 years 5 months ago
Impossibility of Succinct Quantum Proofs for Collision-Freeness
We show that any quantum algorithm to decide whether a function f : [n] → [n] is a permutation or far from a permutation must make Ω n1/3 /w queries to f, even if the algorith...
Scott Aaronson
IEEEPACT
2000
IEEE
15 years 2 months ago
Exploring the Limits of Sub-Word Level Parallelism
Multimedia instruction set extensions have become a prominent feature in desktop microprocessor platforms, promising superior performance on a wide range of floating-point and int...
Kevin Scott, Jack W. Davidson
ICCBR
2001
Springer
15 years 2 months ago
Taxonomic Conversational Case-Based Reasoning
Conversational Case-Based Reasoning (CCBR) systems engage a user in a series of questions and answers to retrieve cases that solve his/her current problem. Help-desk and interactiv...
Kalyan Moy Gupta
AAI
2006
110views more  AAI 2006»
14 years 10 months ago
Evaluation of Classifiers for an Uneven Class Distribution Problem
Classification problems with uneven class distributions present several difficulties during the training as well as during the evaluation process of classifiers. A classification ...
Sophia Daskalaki, Ioannis Kopanas, Nikolaos M. Avo...