Sciweavers

1132 search results - page 111 / 227
» Structural Average Case Complexity
Sort
View
VLDB
2002
ACM
113views Database» more  VLDB 2002»
14 years 9 months ago
Searching in metric spaces by spatial approximation
We propose a new data structure to search in metric spaces. A metric space is formed by a collection of objects and a distance function de ned among them, which satis es the trian...
Gonzalo Navarro
STACS
2009
Springer
14 years 3 months ago
Enumerating Homomorphisms
The homomorphism problem for relational structures is an abstract way of formulating constraint satisfaction problems (CSP) and various problems in database theory. The decision ve...
Andrei A. Bulatov, Víctor Dalmau, Martin Gr...
CSMR
2009
IEEE
14 years 1 months ago
Software Clustering Using Dynamic Analysis and Static Dependencies
Decomposing a software system into smaller, more manageable clusters is a common approach to support the comprehension of large systems. In recent years, researchers have focused ...
Chiragkumar Patel, Abdelwahab Hamou-Lhadj, Juergen...
UM
2001
Springer
14 years 1 months ago
Modeling Literary Style for Semi-automatic Generation of Poetry
Abstract. The generation of formal poetry involves both complex creativity usually exercised by a human poet - and strict algorithmic restrictions regarding the metrical structure ...
Pablo Gervás
IPCO
2008
114views Optimization» more  IPCO 2008»
13 years 10 months ago
The Stochastic Machine Replenishment Problem
We study the stochastic machine replenishment problem, which is a canonical special case of closed multiclass queuing systems in Markov decision theory. The problem models the sche...
Kamesh Munagala, Peng Shi