Sciweavers

1568 search results - page 247 / 314
» The problem of examination questions in algorithmics
Sort
View
KDD
2006
ACM
166views Data Mining» more  KDD 2006»
16 years 4 months ago
Anonymizing sequential releases
An organization makes a new release as new information become available, releases a tailored view for each data request, releases sensitive information and identifying information...
Ke Wang, Benjamin C. M. Fung
ICC
2009
IEEE
154views Communications» more  ICC 2009»
15 years 11 months ago
Load Balancing vs. Distributed Rate Limiting: An Unifying Framework for Cloud Control
— With the expansion of cloud-based services, the question as to how to control usage of such large distributed systems has become increasingly important. Load balancing (LB), an...
Rade Stanojevic, Robert Shorten
INFOCOM
2009
IEEE
15 years 11 months ago
Minimizing Average Finish Time in P2P Networks
—Peer-to-peer (P2P) file distribution is a scalable way to disseminate content to a wide audience. For a P2P network, one fundamental performance metric is the average time need...
G. Matthew Ezovski, Ao Tang, Lachlan L. H. Andrew
IDA
2009
Springer
15 years 10 months ago
How to Control Clustering Results? Flexible Clustering Aggregation
One of the most important and challenging questions in the area of clustering is how to choose the best-fitting algorithm and parameterization to obtain an optiml clustering for t...
Martin Hahmann, Peter Benjamin Volk, Frank Rosenth...
ICPR
2008
IEEE
15 years 10 months ago
Improvement of feature matching in catadioptric images using gyroscope data
Most of vision-based algorithms for motion and localization estimation requires matching some interest points in a pair of images. After building feature correspondence, it is pos...
Jean Charles Bazin, Inso Kweon, Cédric Demo...