5539 search results - page 39 / 1108 » What can be computed locally |
DAC
2004
ACM
14 years 1 months ago
2004
ACM
In this paper, we investigate the problem of repeater insertion for low power under a given timing budget. We propose a novel repeater insertion algorithm to compute the optimal r...
SIGIR
2006
ACM
14 years 3 months ago
2006
ACM
In today’s data-rich networked world, people express many aspects of their lives online. It is common to segregate different aspects in different places: you might write opinion...
FLAIRS
2003
13 years 11 months ago
2003
Freuder in (1991) defined interchangeability for classical Constraint Satisfaction Problems (CSPs). Recently (2002), we extended the definition of interchangeability to Soft CSP...
PODC
1996
ACM
14 years 2 months ago
1996
ACM
This paper is an answer to the question: "What is unique and conceptually different about mobile computing?" The paper begins by describing a set of constraints intrinsi...
CVPR
1997
IEEE
14 years 2 months ago
1997
IEEE
In this paper we focus on using local 3D structure for segmentation. A tensor descriptor is estimated for each neighbourhood, i.e. for each voxel in the data set. The tensors are ...