1399 search results - page 190 / 280 » New Algorithms for k-Center and Extensions |
EUROPAR
2010
Springer
13 years 10 months ago
2010
Springer
Manual parallelization of programs is known to be difficult and error-prone, and there are currently few ways to measure the amount of potential parallelism in the original sequent...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
We continue the line of research on graph compression started in [BV04], but we move our focus to the compression of social networks in a proper sense (e.g., LiveJournal): the app...
IJCV
2006
13 years 8 months ago
2006
A new approach performing surface extraction from 3D images under user defined geometrical constraints is presented. The constraints are introduced through boundary curves given by...
JCO
2006
13 years 8 months ago
2006
Power assignment for wireless ad hoc networks is to assign a power for each wireless node such that the induced communication graph has some required properties. Recently research ...
JSAC
2006
13 years 8 months ago
2006
Abstract--Packet matching plays a critical role in the performance of many network devices and a tremendous amount of research has already been invested to come up with better opti...