Sciweavers

1040 search results - page 52 / 208
» Tools for modeling and solving search problems
Sort
View
173
Voted
SPIRE
2005
Springer
15 years 9 months ago
Using the k-Nearest Neighbor Graph for Proximity Searching in Metric Spaces
Proximity searching consists in retrieving from a database, objects that are close to a query. For this type of searching problem, the most general model is the metric space, where...
Rodrigo Paredes, Edgar Chávez
IEAAIE
2009
Springer
15 years 10 months ago
Using Genetic Process Mining Technology to Construct a Time-Interval Process Model
Nowadays, some process information is represented by a process model. To understand process executed in many activities, process mining technologies are now extensively studied to...
Chieh-Yuan Tsai, I-Ching Chen
128
Voted
ICADL
2003
Springer
147views Education» more  ICADL 2003»
15 years 9 months ago
Effective Image Annotation for Search Using Multi-level Semantics
There is an increasing need of development of automatic tools to annotate images for effective image searching in digital libraries. In this paper, we present a novel probabilistic...
Pu-Jen Cheng, Lee-Feng Chien
136
Voted
CPAIOR
2004
Springer
15 years 7 months ago
A Global Constraint for Graph Isomorphism Problems
The graph isomorphism problem consists in deciding if two given graphs have an identical structure. This problem can be modeled as a constraint satisfaction problem in a very strai...
Sébastien Sorlin, Christine Solnon
124
Voted
CRYPTO
2005
Springer
83views Cryptology» more  CRYPTO 2005»
15 years 9 months ago
A Practical Attack on a Braid Group Based Cryptographic Protocol
In this paper we present a practical heuristic attack on the Ko, Lee et al. key exchange protocol introduced at Crypto 2000 [10]. One of the ideas behind our attack is using Dehorn...
Alexei G. Myasnikov, Vladimir Shpilrain, Alexander...