Sciweavers

3466 search results - page 46 / 694
» Fast computation of special resultants
Sort
View
81
Voted
MICCAI
2005
Springer
16 years 1 months ago
Fast and Simple Calculus on Tensors in the Log-Euclidean Framework
Computations on tensors have become common with the use of DT-MRI. But the classical Euclidean framework has many defects, and affine-invariant Riemannian metrics have been propose...
Vincent Arsigny, Pierre Fillard, Xavier Pennec, Ni...
ORL
1998
68views more  ORL 1998»
15 years 9 days ago
A fast bipartite network flow algorithm for selective assembly
Bipartite network flow problems naturally arise in applications such as selective assembly and preemptive scheduling. This paper presents fast algorithms for these problems that ...
Satoru Iwata, Tomomi Matsui, S. Thomas McCormick
102
Voted
CODES
2008
IEEE
15 years 7 months ago
Static analysis for fast and accurate design space exploration of caches
Application-specific system-on-chip platforms create the opportunity to customize the cache configuration for optimal performance with minimal chip estate. Simulation, in partic...
Yun Liang, Tulika Mitra
144
Voted
ICARCV
2002
IEEE
149views Robotics» more  ICARCV 2002»
15 years 5 months ago
A fast method to simulate virtual deformable objects with force feedback
In this paper, we propose solutions to real time simulation and interaction of deformable objects in virtual reality. Firstly, we present LEM - Long Element Method, a method creat...
Kenneth Sundaraj, César Mendoza, Christian ...
86
Voted
FSTTCS
2006
Springer
15 years 4 months ago
Fast Exponential Algorithms for Maximum r-Regular Induced Subgraph Problems
Given a graph G=(V, E) on n vertices, the MAXIMUM r-REGULAR INDUCED SUBGRAPH (M-r-RIS) problems ask for a maximum sized subset of vertices R V such that the induced subgraph on R,...
Sushmita Gupta, Venkatesh Raman, Saket Saurabh