Sciweavers

3497 search results - page 13 / 700
» Making Distributed Applications Robust
Sort
View
CVPR
2011
IEEE
14 years 3 months ago
Adaptive Random Forest - How many ``experts'' to ask before making a decision?
How many people should you ask if you are not sure about your way? We provide an answer to this question for Random Forest classification. The presented method is based on the st...
Alexander Schwing, Christopher Zach, Yefeng Zheng,...
MOBISYS
2009
ACM
16 years 7 days ago
EnTracked: energy-efficient robust position tracking for mobile devices
An important feature of a modern mobile device is that it can position itself. Not only for use on the device but also for remote applications that require tracking of the device....
Mikkel Baun Kjærgaard, Jakob Langdal, Torben...
KDD
2006
ACM
173views Data Mining» more  KDD 2006»
16 years 3 days ago
Robust information-theoretic clustering
How do we find a natural clustering of a real world point set, which contains an unknown number of clusters with different shapes, and which may be contaminated by noise? Most clu...
Christian Böhm, Christos Faloutsos, Claudia P...
DL
1998
Springer
138views Digital Library» more  DL 1998»
15 years 4 months ago
Making Metadata: A Study of Metadata Creation for a Mixed Physical-Digital Collection
Metadata is an important way of creating order in emerging distributed digital library collections. This paper presents an analysis of ethnographic data gathered in a university l...
Catherine C. Marshall
DEBS
2007
ACM
15 years 3 months ago
The arbitrary Boolean publish/subscribe model: making the case
In this paper, we present BoP, a content-based publish/subscribe system for arbitrary Boolean subscriptions and advertisements. BoP targets at the time and space-efficient matchin...
Sven Bittner, Annika Hinze