Sciweavers

4486 search results - page 819 / 898
» Adaptable Boundary Sets
Sort
View
SGP
2007
14 years 1 months ago
Dynamic geometry registration
We propose an algorithm that performs registration of large sets of unstructured point clouds of moving and deforming objects without computing correspondences. Given as input a s...
Niloy J. Mitra, Simon Flöry, Maks Ovsjanikov,...
FAST
2010
14 years 1 months ago
Discovery of Application Workloads from Network File Traces
An understanding of application I/O access patterns is useful in several situations. First, gaining insight into what applications are doing with their data at a semantic level he...
Neeraja J. Yadwadkar, Chiranjib Bhattacharyya, K. ...
AIPS
2008
14 years 1 months ago
Fast Dynamic Scheduling of Disjunctive Temporal Constraint Networks through Incremental Compilation
Autonomous systems operating in real-world environments must plan, schedule, and execute missions while robustly adapting to uncertainty and disturbance. One way to mitigate the e...
Julie A. Shah, Brian C. Williams
COLT
2008
Springer
14 years 27 days ago
Almost Tight Upper Bound for Finding Fourier Coefficients of Bounded Pseudo- Boolean Functions
A pseudo-Boolean function is a real-valued function defined on {0, 1}n . A k-bounded function is a pseudo-Boolean function that can be expressed as a sum of subfunctions each of w...
Sung-Soon Choi, Kyomin Jung, Jeong Han Kim
BCS
2008
14 years 17 days ago
A Customisable Multiprocessor for Application-Optimised Inductive Logic Programming
This paper describes a customisable processor designed to accelerate execution of inductive logic programming, targeting advanced field-programmable gate array (FPGA) technology. ...
Andreas Fidjeland, Wayne Luk, Stephen Muggleton