Sciweavers

402 search results - page 18 / 81
» Constant-Time Approximation Algorithms via Local Improvement...
Sort
View
SODA
2008
ACM
101views Algorithms» more  SODA 2008»
13 years 9 months ago
Adaptive local ratio
Local ratio is a well-known paradigm for designing approximation algorithms for combinatorial optimization problems. At a very high level, a local-ratio algorithm first decomposes ...
Julián Mestre
CIKM
2004
Springer
14 years 1 months ago
Local methods for estimating pagerank values
The Google search engine uses a method called PageRank, together with term-based and other ranking techniques, to order search results returned to the user. PageRank uses link ana...
Yen-Yu Chen, Qingqing Gan, Torsten Suel
INFOCOM
2010
IEEE
13 years 6 months ago
Analyzing the Performance of Greedy Maximal Scheduling via Local Pooling and Graph Theory
—Efficient operation of wireless networks and switches requires using simple (and in some cases distributed) scheduling algorithms. In general, simple greedy algorithms (known a...
Berk Birand, Maria Chudnovsky, Bernard Ries, Paul ...
COMCOM
2008
99views more  COMCOM 2008»
13 years 6 months ago
Reliability improvement for an RFID-based psychiatric patient localization system
Collaboration between Field Generators, Readers and Tags generates the required functions in using radio frequency identification (RFID) for psychiatric patient localization. The ...
Chieh-Ling Huang, Pau-Choo Chung, Ming-Hua Tsai, Y...
ISBI
2008
IEEE
14 years 8 months ago
Improving single particle localization with an empirically calibrated Gaussian kernel
Accurate computational localization of single fluorescent particles is of interest to many biophysical studies and underlies recent approaches to high resolution microscopy using ...
Marcio de Moraes Marim, Bo Zhang, Jean-Christophe ...