6110 search results - page 398 / 1222 » Approximate Computing |
164
click to vote
SIGECOM
2005
ACM
16 years 11 days ago
2005
ACM
We study two problems, that of computing social optimum and that of finding fair allocations, in the congestion game model of Milchtaich[8] Although we show that the general prob...
193
click to vote
ECCV
2002
Springer
16 years 8 months ago
2002
Springer
Abstract. In many vision problems, the observed data lies in a nonlinear manifold in a high-dimensional space. This paper presents a generic modelling scheme to characterize the no...
175
click to vote
ISSAC
1995
Springer
15 years 10 months ago
1995
Springer
An improved method for expressing the greatest common divisor of n numbers as an integer linear combination of the numbers is presented and analyzed, both theoretically and practi...
223
click to vote
SWAT
2010
Springer
15 years 12 months ago
2010
Springer
We consider the problem of partitioning the set of vertices of a given unit disk graph (UDG) into a minimum number of cliques. The problem is NP-hard and various constant factor a...
209
Voted
ICPADS
1994
IEEE
15 years 11 months ago
1994
IEEE
Testingthe performance scalabilityof parallelprograms can be a time consuming task, involving many performance runs for different computer configurations, processor numbers, and p...