Sciweavers

1845 search results - page 259 / 369
» Machine-Learning Applications of Algorithmic Randomness
Sort
View
CORR
2006
Springer
111views Education» more  CORR 2006»
13 years 8 months ago
Length-based cryptanalysis: The case of Thompson's Group
The length-based approach is a heuristic for solving randomly generated equations in groups which possess a reasonably behaved length function. We describe several improvements of ...
Dima Ruinskiy, Adi Shamir, Boaz Tsaban
ALGORITHMICA
2005
108views more  ALGORITHMICA 2005»
13 years 8 months ago
Key-Independent Optimality
A new form of optimality for comparison based static dictionaries is introduced. This type of optimality, keyindependent optimality, is motivated by applications that assign key v...
John Iacono
ESA
2006
Springer
130views Algorithms» more  ESA 2006»
13 years 12 months ago
Robust, Generic and Efficient Construction of Envelopes of Surfaces in Three-Dimensional Spaces
Lower envelopes are fundamental structures in computational geometry, which have many applications, such as computing general Voronoi diagrams and performing hidden surface removal...
Michal Meyerovitch
ICWS
2010
IEEE
13 years 6 months ago
An Approach for Mining Web Service Composition Patterns from Execution Logs
A service-oriented application is composed of multiple web services to fulfill complex functionality that cannot be provided by individual web service. The combination of services ...
Ran Tang, Ying Zou
JCO
2007
123views more  JCO 2007»
13 years 8 months ago
On the number of local minima for the multidimensional assignment problem
The Multidimensional Assignment Problem (MAP) is an NP-hard combinatorial optimization problem occurring in many applications, such as data association, target tracking, and resou...
Don A. Grundel, Pavlo A. Krokhmal, Carlos A. S. Ol...