Sciweavers

217 search results - page 14 / 44
» Deterministic Algorithm for the t-Threshold Set Problem
Sort
View
SOFSEM
2007
Springer
14 years 1 months ago
Fast Approximate Point Set Matching for Information Retrieval
We investigate randomised algorithms for subset matching with spatial point sets—given two sets of d-dimensional points: a data set T consisting of n points and a pattern P consi...
Raphaël Clifford, Benjamin Sach
ISCAPDCS
2004
13 years 9 months ago
Distributed Algorithms for DCOP: A Graphical-Game-Based Approach
This paper addresses the application of distributed constraint optimization problems (DCOPs) to large-scale dynamic environments. We introduce a decomposition of DCOP into a graph...
Rajiv T. Maheswaran, Jonathan P. Pearce, Milind Ta...
BIBM
2009
IEEE
113views Bioinformatics» more  BIBM 2009»
13 years 11 months ago
Fast Motif Selection for Biological Sequences
—We consider the problem of identifying motifs, recurring or conserved patterns, in the sets of biological sequences. To solve this task, we present new deterministic and exact a...
Pavel P. Kuksa, Vladimir Pavlovic
MFCS
2004
Springer
14 years 1 months ago
Online Algorithms for Disk Graphs
We study the on-line versions of two fundamental graph problems, maximum independent set and minimum coloring, for the case of disk graphs which are graphs resulting from intersect...
Ioannis Caragiannis, Aleksei V. Fishkin, Christos ...
AIPS
1998
13 years 9 months ago
Solving Stochastic Planning Problems with Large State and Action Spaces
Planning methods for deterministic planning problems traditionally exploit factored representations to encode the dynamics of problems in terms of a set of parameters, e.g., the l...
Thomas Dean, Robert Givan, Kee-Eung Kim