Sciweavers

1594 search results - page 123 / 319
» An Algorithm to Compute Collusion Paths
Sort
View
ACL
2010
15 years 1 months ago
Learning to Follow Navigational Directions
We present a system that learns to follow navigational natural language directions. Where traditional models learn from linguistic annotation or word distributions, our approach i...
Adam Vogel, Daniel Jurafsky
142
Voted
DCOSS
2007
Springer
15 years 7 months ago
Energy Efficient Intrusion Detection in Camera Sensor Networks
The problem we address in this paper is how to detect an intruder moving through a polygonal space that is equipped with a camera sensor network. We propose a probabilistic sensor ...
Primoz Skraba, Leonidas J. Guibas
SIAMCOMP
2000
125views more  SIAMCOMP 2000»
15 years 3 months ago
Approximating the Stretch Factor of Euclidean Graphs
There are several results available in the literature dealing with efficient construction of t-spanners for a given set S of n points in Rd. t-spanners are Euclidean graphs in whic...
Giri Narasimhan, Michiel H. M. Smid
IAJIT
2006
109views more  IAJIT 2006»
15 years 3 months ago
Unconstraint Assignment Problem: A Molecular Computing Approach
: Deoxyribonucleic Acid or DNA-based computing is an emerging field that bridging the gap between chemistry, molecular biology, computer science, and mathematics. This research are...
Zuwairie Ibrahim, Yusei Tsuboi, Osamu Ono, Marzuki...
FUIN
2000
68views more  FUIN 2000»
15 years 3 months ago
Models For Dependable Computation with Multiple Inputs and Some Hardness Results
We consider the problem of dependable computation with multiple inputs. The goal is to study when redundancy can help to achieve survivability and when it cannot. We use AND/OR gra...
Yongge Wang, Yvo Desmedt, Mike Burmester