Sciweavers

130 search results - page 12 / 26
» Finding and Certifying Loops
Sort
View
KDD
2003
ACM
156views Data Mining» more  KDD 2003»
14 years 8 months ago
Mining distance-based outliers in near linear time with randomization and a simple pruning rule
Defining outliers by their distance to neighboring examples is a popular approach to finding unusual examples in a data set. Recently, much work has been conducted with the goal o...
Stephen D. Bay, Mark Schwabacher
CARS
2003
13 years 9 months ago
Automatic path searching for interactive navigation support within virtual medical 3D objects
This article proposes the use of autonomous actors for navigation support within complex virtual medical objects reconstructed from Computed Tomography or Magnetic Resonance Imagi...
Hansrudi Noser, Christian Stern, Peter Stucki
IJISEC
2008
108views more  IJISEC 2008»
13 years 7 months ago
A note on the Ate pairing
The Ate pairing has been suggested since it can be computed efficiently on ordinary elliptic curves with small values of the traces of Frobenius t. However, not all pairing-friendl...
Changan Zhao, Fangguo Zhang, Jiwu Huang
CDC
2009
IEEE
132views Control Systems» more  CDC 2009»
13 years 5 months ago
Temporal logic control of discrete-time piecewise affine systems
Abstract-- We consider the problem of controlling a discretetime piecewise affine (PWA) system from a specification given as a Linear Temporal Logic (LTL) formula over linear predi...
Boyan Yordanov, Calin Belta
ATAL
2010
Springer
13 years 8 months ago
Merging example plans into generalized plans for non-deterministic environments
We present a new approach for finding generalized contingent plans with loops and branches in situations where there is uncertainty in state properties and object quantities, but ...
Siddharth Srivastava, Neil Immerman, Shlomo Zilber...