Sciweavers

5169 search results - page 929 / 1034
» Locality approximation using time
Sort
View
DAGSTUHL
2007
15 years 4 months ago
Logical Particle Filtering
Abstract. In this paper, we consider the problem of filtering in relational hidden Markov models. We present a compact representation for such models and an associated logical par...
Luke S. Zettlemoyer, Hanna M. Pasula, Leslie Pack ...
SODA
2001
ACM
87views Algorithms» more  SODA 2001»
15 years 4 months ago
Steiner points in tree metrics don't (really) help
Consider an edge-weighted tree T = (V, E, w : E R+ ), in which a subset R of the nodes (called the required nodes) are colored red and the remaining nodes in S = V \R are colored ...
Anupam Gupta
120
Voted
CORR
2008
Springer
91views Education» more  CORR 2008»
15 years 3 months ago
A Logical Model and Data Placement Strategies for MEMS Storage Devices
MEMS storage devices are new non-volatile secondary storages that have outstanding advantages over magnetic disks. MEMS storage devices, however, are much different from magnetic ...
Yi-Reun Kim, Kyu-Young Whang, Min-Soo Kim 0002, Il...
AIL
2004
107views more  AIL 2004»
15 years 3 months ago
AI and the Conquest of Complexity in Law
The paper identi es some of the problems with legal systems and outlines the potential of AI technology for overcoming them. For expository purposes, this outline is based on a si...
L. Bibel
144
Voted
ETT
2002
89views Education» more  ETT 2002»
15 years 3 months ago
Delay analysis of a probabilistic priority discipline
In computer networks, the Strict Priority (SP) discipline is perhaps the most common and simplest method to schedule packets from different classes of applications, each with diver...
Yuming Jiang, Chen-Khong Tham, Chi Chung Ko