Sciweavers

3702 search results - page 571 / 741
» Reducing Misclassification Costs
Sort
View
TON
2002
175views more  TON 2002»
15 years 5 months ago
Compressed bloom filters
A Bloom filter is a simple space-efficient randomized data structure for representing a set in order to support membership queries. Although Bloom filters allow false positives, f...
Michael Mitzenmacher
VLDB
2002
ACM
135views Database» more  VLDB 2002»
15 years 5 months ago
Maintaining Coherency of Dynamic Data in Cooperating Repositories
In this paper, we consider techniques for disseminating dynamic data--such as stock prices and real-time weather information--from sources to a set of repositories. We focus on th...
Shetal Shah, Krithi Ramamritham, Prashant J. Sheno...
MIS
2007
Springer
163views Multimedia» more  MIS 2007»
15 years 5 months ago
Cooperative caching in mobile ad hoc networks based on data utility
Cooperative caching, which allows sharing and coordination of cached data among clients, is a potential technique to improve the data access performance and availability in mobile ...
Narottam Chand, Ramesh C. Joshi, Manoj Misra
MSOM
2007
105views more  MSOM 2007»
15 years 5 months ago
Managing a Bank's Currency Inventory Under New Federal Reserve Guidelines
New currency recirculation guidelines implemented by the Federal Reserve System (Fed) of the United States are intended to reduce the overuse of its currency processing services b...
H. Neil Geismar, Milind Dawande, Divakar Rajamani,...
PAMI
2007
125views more  PAMI 2007»
15 years 5 months ago
Matching by Linear Programming and Successive Convexification
—We present a novel convex programming scheme to solve matching problems, focusing on the challenging problem of matching in a large search range and with cluttered background. M...
Hao Jiang, Mark S. Drew, Ze-Nian Li