Sciweavers

569 search results - page 57 / 114
» An Efficient Algorithm for Solving Dynamic Complex DCOP Prob...
Sort
View
ASMTA
2008
Springer
167views Mathematics» more  ASMTA 2008»
13 years 9 months ago
Perfect Simulation of Stochastic Automata Networks
The solution of continuous and discrete-time Markovian models is still challenging mainly when we model large complex systems, for example, to obtain performance indexes of paralle...
Paulo Fernandes, Jean-Marc Vincent, Thais Webber
ICCV
2009
IEEE
15 years 19 days ago
Efficient subset selection based on the Renyi entropy
Many machine learning algorithms require the summation of Gaussian kernel functions, an expensive operation if implemented straightforwardly. Several methods have been proposed t...
Vlad I. Morariu1, Balaji V. Srinivasan, Vikas C. R...
PVLDB
2008
136views more  PVLDB 2008»
13 years 7 months ago
Keyword query cleaning
Unlike traditional database queries, keyword queries do not adhere to predefined syntax and are often dirty with irrelevant words from natural languages. This makes accurate and e...
Ken Q. Pu, Xiaohui Yu
DAGSTUHL
2006
13 years 9 months ago
Upper and Lower Bounds on Sizes of Finite Bisimulations of Pfaffian Dynamical Systems
In this paper we study a class of dynamical systems defined by Pfaffian maps. It is a sub-class of o-minimal dynamical systems which capture rich continuous dynamics and yet can be...
Margarita V. Korovina, Nicolai Vorobjov
BIBE
2007
IEEE
174views Bioinformatics» more  BIBE 2007»
14 years 2 months ago
Shortest Path Approaches for the Longest Common Subsequence of a Set of Strings
—We investigate the k-LCS problem that is finding a longest common subsequence (LCS) for k given input strings. The problem is known to have practical solutions for k = 2, but f...
Marina Barsky, Ulrike Stege, Alex Thomo, Chris Upt...