Sciweavers

193 search results - page 23 / 39
» Partial Solutions with Unique Completion
Sort
View
CASCON
1996
77views Education» more  CASCON 1996»
13 years 8 months ago
Harvesting design for an application framework
Framework design begins with domain analysis. Either the problem domain is analyzed to create a new design, or the solution domain is analyzed to understand how the problem has al...
Joan Boone
ICCAD
2008
IEEE
130views Hardware» more  ICCAD 2008»
14 years 1 months ago
Area-I/O flip-chip routing for chip-package co-design
— The area-I/O flip-chip package provides a high chip-density solution to the demand of more I/O’s in VLSI designs; it can achieve smaller package size, shorter wirelength, an...
Jia-Wei Fang, Yao-Wen Chang
STOC
2007
ACM
134views Algorithms» more  STOC 2007»
14 years 7 months ago
Hardness of routing with congestion in directed graphs
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...
Julia Chuzhoy, Venkatesan Guruswami, Sanjeev Khann...
CMA
2010
134views more  CMA 2010»
13 years 4 months ago
Particle tracking for fractional diffusion with two time scales
Abstract. Previous work [51] showed how to solve time-fractional diffusion equations by particle tracking. This paper extends the method to the case where the order of the fraction...
Mark M. Meerschaert, Yong Zhang, Boris Baeumer
IJCV
2006
165views more  IJCV 2006»
13 years 7 months ago
A Riemannian Framework for Tensor Computing
Tensors are nowadays a common source of geometric information. In this paper, we propose to endow the tensor space with an affine-invariant Riemannian metric. We demonstrate that ...
Xavier Pennec, Pierre Fillard, Nicholas Ayache