Sciweavers

1080 search results - page 214 / 216
» The Complexity of Belief Update
Sort
View
CIKM
2010
Springer
14 years 10 months ago
A hierarchical approach to reachability query answering in very large graph databases
The cost of reachability query computation using traditional algorithms such as depth first search or transitive closure has been found to be prohibitive and unacceptable in mass...
Saikat K. Dey, Hasan M. Jamil
CORR
2010
Springer
103views Education» more  CORR 2010»
14 years 10 months ago
Structural Solutions to Dynamic Scheduling for Multimedia Transmission in Unknown Wireless Environments
In this paper, we propose a systematic solution to the problem of scheduling delay-sensitive media data for transmission over time-varying wireless channels. We first formulate th...
Fangwen Fu, Mihaela van der Schaar
IS
2010
14 years 10 months ago
Extracting a largest redundancy-free XML storage structure from an acyclic hypergraph in polynomial time
Given a hypergraph and a set of embedded functional dependencies, we investigate the problem of determining the conditions under which we can efficiently generate redundancy-free ...
Wai Yin Mok, Joseph Fong, David W. Embley
JIDM
2010
155views more  JIDM 2010»
14 years 10 months ago
DeweyIDs - The Key to Fine-Grained Management of XML Documents
Because XML documents tend to be very large and are more and more collaboratively processed, their fine-grained storage and management is a must for which, in turn, a flexible tree...
Michael Peter Haustein, Theo Härder, Christia...
TOH
2010
97views more  TOH 2010»
14 years 10 months ago
A Frequency-Domain Analysis of Haptic Gratings
—The detectability and discriminability of virtual haptic gratings were analyzed in the frequency domain. Detection (Exp. 1) and discrimination (Exp. 2) thresholds for virtual ha...
Steven A. Cholewiak, Kwangtaek Kim, Hong Z. Tan, B...