Sciweavers

1672 search results - page 93 / 335
» Tightness problems in the plane
Sort
View
SCAI
1993
13 years 10 months ago
A Case-Based Answer to Some Problems of Knowledge-Based Systems
Among the most important challenges for contemporary AI research are the development of methods for improved robustness, adaptability, and overall interactiveness of systems. Inter...
Agnar Aamodt
CORR
2010
Springer
149views Education» more  CORR 2010»
13 years 9 months ago
Pebbling and Branching Programs Solving the Tree Evaluation Problem
We study restricted computation models related to the tree evaluation problem. The TEP was introduced in earlier work as a simple candidate for the (very) long term goal of separa...
Dustin Wehr
BICOB
2010
Springer
14 years 1 months ago
A Grid-Enabled Problem Solving Environment for QTL Analysis in R
We present a grid-enabled problem solving environment (PSE), for multidimensional QTL analysis. The concept of a computational grid has not been fully realized within this and oth...
Mahen Jayawardena, Carl Nettelblad, Salman Zubair ...
CORR
2010
Springer
152views Education» more  CORR 2010»
13 years 9 months ago
Microlocal Analysis of the Geometric Separation Problem
Image data are often composed of two or more geometrically distinct constituents; in galaxy catalogs, for instance, one sees a mixture of pointlike structures (galaxy supercluster...
David L. Donoho, Gitta Kutyniok
COCO
2003
Springer
145views Algorithms» more  COCO 2003»
14 years 2 months ago
Hardness vs. Randomness within Alternating Time
We study the complexity of building pseudorandom generators (PRGs) with logarithmic seed length from hard functions. We show that, starting from a function f : {0, 1}l → {0, 1} ...
Emanuele Viola