Sciweavers

6546 search results - page 166 / 1310
» Improving the Performance of the RISE Algorithm
Sort
View
INFOCOM
2010
IEEE
15 years 4 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 ...
DASFAA
2007
IEEE
160views Database» more  DASFAA 2007»
16 years 22 days ago
Implementation of Bitmap Based Incognito and Performance Evaluation
In the era of the Internet, more and more privacy-sensitive data is published online. Even though this kind of data are published with sensitive attributes such as name and social ...
Hyun-Ho Kang, Jae-Myung Kim, Gap-Joo Na, Sang-Won ...
ICIAP
2003
ACM
16 years 6 months ago
A statistical rationalisation of Hartley's normalised eight-point algorithm
The eight-point algorithm of Hartley occupies an important place in computer vision, notably as a means of providing an initial value of the fundamental matrix for use in iterativ...
Wojciech Chojnacki, Michael J. Brooks, Anton van d...
RSCTC
2000
Springer
151views Fuzzy Logic» more  RSCTC 2000»
15 years 10 months ago
Anytime Algorithm for Feature Selection
Feature selection is used to improve performance of learning algorithms by finding a minimal subset of relevant features. Since the process of feature selection is computationally ...
Mark Last, Abraham Kandel, Oded Maimon, Eugene Ebe...
ALGORITHMICA
1998
75views more  ALGORITHMICA 1998»
15 years 6 months ago
Average Case Analyses of List Update Algorithms, with Applications to Data Compression
We study the performance of the Timestamp(0) (TS(0)) algorithm for self-organizing sequential search on discrete memoryless sources. We demonstrate that TS(0) is better than Move-...
Susanne Albers, Michael Mitzenmacher