Sciweavers

1213 search results - page 6 / 243
» Approximation in quantale-enriched categories
Sort
View
209
Voted
SIGMOD
2009
ACM
111views Database» more  SIGMOD 2009»
16 years 3 months ago
Language-model-based ranking in entity-relation graphs
We propose a language-model-based ranking approach for SPARQLlike queries on entity-relationship graphs. Our ranking model supports exact matching, approximate structure matching,...
Shady Elbassuoni, Maya Ramanath, Gerhard Weikum
136
Voted
GECCO
2010
Springer
239views Optimization» more  GECCO 2010»
15 years 6 months ago
Benchmarking SPSA on BBOB-2010 noiseless function testbed
This paper presents the result for Simultaneous Perturbation Stochastic Approximation (SPSA) on the BBOB 2010 noiseless testbed. SPSA is a stochastic gradient approximation strate...
Steffen Finck, Hans-Georg Beyer
GECCO
2008
Springer
168views Optimization» more  GECCO 2008»
15 years 4 months ago
Parameterizing pair approximations for takeover dynamics
Pair approximations have often been used to predict equilibrium conditions in spatially-explicit epidemiological and ecological systems. In this work, we investigate whether this ...
Joshua L. Payne, Margaret J. Eppstein
STOC
2003
ACM
164views Algorithms» more  STOC 2003»
16 years 3 months ago
Approximate counting by dynamic programming
We give efficient algorithms to sample uniformly, and count approximately, the solutions to a zero-one knapsack problem. The algorithm is based on using dynamic programming to pro...
Martin E. Dyer
124
Voted
PODS
2008
ACM
153views Database» more  PODS 2008»
16 years 3 months ago
Approximation algorithms for co-clustering
Co-clustering is the simultaneous partitioning of the rows and columns of a matrix such that the blocks induced by the row/column partitions are good clusters. Motivated by severa...
Aris Anagnostopoulos, Anirban Dasgupta, Ravi Kumar