Sciweavers

329 search results - page 18 / 66
» New lower bounds for some spherical designs
Sort
View
COMPGEOM
2006
ACM
14 years 2 months ago
Online geometric reconstruction
We investigate a new class of geometric problems based on the idea of online error correction. Suppose one is given access to a large geometric dataset though a query mechanism; f...
Bernard Chazelle, C. Seshadhri
AIEDAM
2008
127views more  AIEDAM 2008»
13 years 8 months ago
Evolving blackbox quantum algorithms using genetic programming
Although it is known that quantum computers can solve certain computational problems exponentially faster than classical computers, only a small number of quantum algorithms have ...
Ralf Stadelhofer, Wolfgang Banzhaf, Dieter Suter
GLOBECOM
2006
IEEE
14 years 2 months ago
Performance Analysis and Optimal Signal Designs for Minimum Decoding Complexity ABBA Codes
— ABBA codes, a class of quasi-orthogonal space-time block codes (STBC) proposed by Tirkkonen et al., have been studied extensively for various applications. Yuen et al. have rec...
Dung Ngoc Dao, Chintha Tellambura
JEA
2006
90views more  JEA 2006»
13 years 8 months ago
Heuristics for estimating contact area of supports in layered manufacturing
Layered Manufacturing is a technology that allows physical prototypes of three-dimensional models to be built directly from their digital representation, as a stack of two-dimensi...
Ivaylo Ilinkin, Ravi Janardan, Michiel H. M. Smid,...
ICCAD
1997
IEEE
108views Hardware» more  ICCAD 1997»
14 years 20 days ago
Negative thinking by incremental problem solving: application to unate covering
We introduce a new technique to solve exactly a discrete optimization problem, based on the paradigm of “negative” thinking. The motivation is that when searching the space of...
Evguenii I. Goldberg, Luca P. Carloni, Tiziano Vil...