Sciweavers

1508 search results - page 78 / 302
» Efficient Path Profiling
Sort
View
124
Voted
VLDB
1995
ACM
129views Database» more  VLDB 1995»
15 years 6 months ago
A Cost Model for Clustered Object-Oriented Databases
Query processing is one of the most, critical issues in Object-Oriented DBMSs. Extensible opt,imizers with efficient, search strategies require a cost model to select the most eff...
Georges Gardarin, Jean-Robert Gruser, Zhao-Hui Tan...
85
Voted
FPL
2005
Springer
125views Hardware» more  FPL 2005»
15 years 8 months ago
Low-Cost Fully Reconfigurable Data-Path for FPGA-Based Multimedia Processor
This paper describes novel data-path architecture for FPGA-based multimedia processors. The proposed circuit can adapt itself at run-time to different operations and data wordleng...
Marco Lanuzza, Stefania Perri, Martin Margala, Pas...
AIPS
2006
15 years 4 months ago
Reconfigurable Path Planning for an Autonomous Unmanned Aerial Vehicle
In this paper, we present a motion planning framework for a fully deployed autonomous unmanned aerial vehicle which integrates two sample-based motion planning techniques, Probabi...
Mariusz Wzorek, Patrick Doherty
123
Voted
DAGSTUHL
2006
15 years 4 months ago
Coxeter Lattice Paths
Supercomputing applications usually involve the repeated parallel application of discretized differential operators. Difficulties arise with higher-order discretizations their com...
Thomas J. Ashby, Anthony D. Kennedy, Stephen M. Wa...
122
Voted
ICFP
2008
ACM
16 years 2 months ago
Write it recursively: a generic framework for optimal path queries
Optimal path queries are queries to obtain an optimal path specified by a given criterion of optimality. There have been many studies to give efficient algorithms for classes of o...
Akimasa Morihata, Kiminori Matsuzaki, Masato Takei...