Sciweavers

992 search results - page 186 / 199
» Dependencies to Optimize Ontology Based Data Access
Sort
View
MOBIHOC
2004
ACM
14 years 1 months ago
On the behavior of communication links of a node in a multi-hop mobile environment
In this work, we develop an analytical framework to investigate the behavior of the communication links of a node in a random mobility environment. Analytical expressions characte...
Prince Samar, Stephen B. Wicker
SPAA
1996
ACM
13 years 11 months ago
From AAPC Algorithms to High Performance Permutation Routing and Sorting
Several recent papers have proposed or analyzed optimal algorithms to route all-to-all personalizedcommunication (AAPC) over communication networks such as meshes, hypercubes and ...
Thomas Stricker, Jonathan C. Hardwick
ECCV
2010
Springer
13 years 7 months ago
MIForests: Multiple-Instance Learning with Randomized Trees
Abstract. Multiple-instance learning (MIL) allows for training classifiers from ambiguously labeled data. In computer vision, this learning paradigm has been recently used in many ...
Christian Leistner, Amir Saffari, Horst Bischof
JNCA
2000
117views more  JNCA 2000»
13 years 7 months ago
Distributed network storage service with quality-of-service guarantees
This paper envisions a distributed network storage service with Quality-ofService (QoS) guarantees, and describes its architecture and key mechanisms. When fully realized, this se...
John Chung-I Chuang, Marvin A. Sirbu
JAIR
2010
143views more  JAIR 2010»
13 years 6 months ago
A Utility-Theoretic Approach to Privacy in Online Services
Online offerings such as web search, news portals, and e-commerce applications face the challenge of providing high-quality service to a large, heterogeneous user base. Recent eff...
Andreas Krause, Eric Horvitz