Sciweavers

520 search results - page 86 / 104
» New Complexity Results for Classical Planning Benchmarks
Sort
View
CEC
2010
IEEE
13 years 8 months ago
An analysis of massively distributed evolutionary algorithms
Computational science is placing new demands on optimization algorithms as the size of data sets and the computational complexity of scientific models continue to increase. As thes...
Travis J. Desell, David P. Anderson, Malik Magdon-...
ISCA
2005
IEEE
126views Hardware» more  ISCA 2005»
14 years 28 days ago
A Tree Based Router Search Engine Architecture with Single Port Memories
Pipelined forwarding engines are used in core routers to meet speed demands. Tree-based searches are pipelined across a number of stages to achieve high throughput, but this resul...
Florin Baboescu, Dean M. Tullsen, Grigore Rosu, Su...
SIBGRAPI
2005
IEEE
14 years 28 days ago
Boolean Operations on Surfel-Bounded Objects Using Constrained BSP-Trees
Point-based modeling and rendering is an active area of research in Computer Graphics. The concept of points with attributes (e.g. normals) is usually referred to as surfels, and ...
Marcus A. C. Farias, Carlos Eduardo Scheidegger, J...
DSP
2008
13 years 7 months ago
Extension of higher-order HMC modeling with application to image segmentation
In this work, we propose to improve the neighboring relationship ability of the Hidden Markov Chain (HMC) model, by extending the memory lengthes of both the Markov chain process ...
Lamia Benyoussef, Cyril Carincotte, Stéphan...
ECCC
2007
123views more  ECCC 2007»
13 years 7 months ago
Lossy Trapdoor Functions and Their Applications
We propose a general cryptographic primitive called lossy trapdoor functions (lossy TDFs), and use it to develop new approaches for constructing several important cryptographic to...
Chris Peikert, Brent Waters