Sciweavers

14161 search results - page 235 / 2833
» On generalized middle-level problem
Sort
View
FPL
2000
Springer
103views Hardware» more  FPL 2000»
15 years 10 months ago
Evaluation of Accelerator Designs for Subgraph Isomorphism Problem
Many applications can be modeled as subgraph isomorphism problems. However, this problem is generally NP-complete and difficult to compute. A custom computing circuit is a prospect...
Shuichi Ichikawa, Hidemitsu Saito, Lerdtanaseangth...
EDM
2010
165views Data Mining» more  EDM 2010»
15 years 8 months ago
Using a Bayesian Knowledge Base for Hint Selection on Domain Specific Problems
A Bayesian Knowledge Base is a generalization of traditional Bayesian Networks where nodes or groups of nodes have independence. In this paper we describe a method of generating a ...
John C. Stamper, Tiffany Barnes, Marvin J. Croy
DAGSTUHL
2004
15 years 8 months ago
On the Complexity of Parabolic Initial Value Problems with Variable Drift
We study the intrinsic difficulty of solving linear parabolic initial value problems numerically at a single point. We present a worst case analysis for deterministic as well as fo...
Knut Petras, Klaus Ritter
SODA
2003
ACM
100views Algorithms» more  SODA 2003»
15 years 7 months ago
Quantum algorithms for some hidden shift problems
Almost all of the most successful quantum algorithms discovered to date exploit the ability of the Fourier transform to recover subgroup structure of functions, especially periodi...
Wim van Dam, Sean Hallgren, Lawrence Ip
AAAI
1996
15 years 7 months ago
Nearly Monotonic Problems: A Key to Effective FA/C Distributed Sensor Interpretation?
The fesractioncslly-Qcczdrrcate, cooperative (FA/C) distributed problem-solving paradigm is one approach for organizing distributed problem solving among homogeneous, cooperating ...
Norman Carver, Victor R. Lesser, Robert Whitehair