Sciweavers

12825 search results - page 437 / 2565
» Improved PLSOM algorithm
Sort
View
APPROX
2009
Springer
131views Algorithms» more  APPROX 2009»
16 years 2 months ago
An Approximation Scheme for Terrain Guarding
We obtain a polynomial time approximation scheme for the terrain guarding problem improving upon several recent constant factor approximations. Our algorithm is a local search algo...
Matt Gibson, Gaurav Kanade, Erik Krohn, Kasturi R....
VTC
2006
IEEE
113views Communications» more  VTC 2006»
16 years 1 months ago
On the Practical Issues in Hop Count Localization of Sensors in a Multihop Network
– Simple algorithms have been developed in the area of node localization in a wireless sensor network. For these simple algorithms to work, several assumptions were made. However...
Eddie B. S. Tan, Joo Ghee Lim, Winston Khoon Guan ...
COMPGEOM
2006
ACM
16 years 1 months ago
How slow is the k-means method?
The k-means method is an old but popular clustering algorithm known for its observed speed and its simplicity. Until recently, however, no meaningful theoretical bounds were known...
David Arthur, Sergei Vassilvitskii
FPGA
2004
ACM
116views FPGA» more  FPGA 2004»
16 years 29 days ago
Low-power technology mapping for FPGA architectures with dual supply voltages
In this paper we study the technology mapping problem of FPGA architectures with dual supply voltages (Vdds) for power optimization. This is done with the guarantee that the mappi...
Deming Chen, Jason Cong, Fei Li, Lei He
IMCSIT
2010
15 years 2 months ago
Entity Summarisation with Limited Edge Budget on Knowledge Graphs
We formulate a novel problem of summarising entities with limited presentation budget on entity-relationship knowledge graphs and propose an efficient algorithm for solving this pr...
Marcin Sydow, Mariusz Pikula, Ralf Schenkel, Adam ...