Sciweavers

365 search results - page 25 / 73
» Local Computation Schemes with Partially Ordered Preferences
Sort
View
ACL
1998
13 years 9 months ago
Eliminative Parsing with Graded Constraints
Abstract Resource adaptlvity" Because the sets of strucNatural language parsing is conceived to be a procedure of disambiguation, which successively reduces an initially total...
Johannes Heinecke, Jürgen Kunze, Wolfgang Men...
MST
2000
101views more  MST 2000»
13 years 8 months ago
Robust Parallel Computations through Randomization
In this paper we present an efficient general simulation strategy for computations designed for fully operational BSP machines of n ideal processors, on n-processor dynamic-fault-p...
Spyros C. Kontogiannis, Grammati E. Pantziou, Paul...
CEC
2007
IEEE
13 years 8 months ago
Entropy-based Memetic Particle Swarm Optimization for computing periodic orbits of nonlinear mappings
— The computation of periodic orbits of nonlinear mappings is very important for studying and better understanding the dynamics of complex systems. Evolutionary algorithms have s...
Y. G. Petalas, Konstantinos E. Parsopoulos, Michae...
ICCV
1999
IEEE
14 years 10 months ago
Free-Form Surface Registration using Surface Signatures
This paper introduces a new free-form surface representation scheme for the purpose of fast and accurate registration and matching. Accurate registration of surfaces is a common t...
Sameh M. Yamany, Aly A. Farag
EDBT
2009
ACM
184views Database» more  EDBT 2009»
14 years 3 months ago
Distributed similarity search in high dimensions using locality sensitive hashing
In this paper we consider distributed K-Nearest Neighbor (KNN) search and range query processing in high dimensional data. Our approach is based on Locality Sensitive Hashing (LSH...
Parisa Haghani, Sebastian Michel, Karl Aberer