Sciweavers

1088 search results - page 193 / 218
» A Bayesian Approach to Tackling Hard Computational Problems
Sort
View
GECCO
2007
Springer
162views Optimization» more  GECCO 2007»
15 years 6 months ago
Some novel locality results for the blob code spanning tree representation
The Blob Code is a bijective tree code that represents each tree on n labelled vertices as a string of n − 2 vertex labels. In recent years, several researchers have deployed th...
Tim Paulden, David K. Smith
120
Voted
OOPSLA
2005
Springer
15 years 6 months ago
Demand-driven points-to analysis for Java
We present a points-to analysis technique suitable for environments with small time and memory budgets, such as just-in-time (JIT) compilers and interactive development environmen...
Manu Sridharan, Denis Gopan, Lexin Shan, Rastislav...
IJRR
2002
92views more  IJRR 2002»
15 years 6 days ago
On Fitted Stratified and Semi-Stratified Geometric Manipulation Planning with Fingertip Relocations
This paper presents two object manipulation planning methods based on fitted stratified and semi-stratified approaches using finger relocations. The problem is discussed in the fr...
István Harmati, Béla Lantos, Shahram...
122
Voted
CODES
2009
IEEE
15 years 7 months ago
FRA: a flash-aware redundancy array of flash storage devices
Since flash memory has many attractive characteristics such as high performance, non-volatility, low power consumption and shock resistance, it has been widely used as storage med...
Yangsup Lee, Sanghyuk Jung, Yong Ho Song
ECCV
2002
Springer
16 years 2 months ago
Tracking and Rendering Using Dynamic Textures on Geometric Structure from Motion
Estimating geometric structure from uncalibrated images accurately enough for high quality rendering is difficult. We present a method where only coarse geometric structure is trac...
Dana Cobzas, Martin Jägersand