Sciweavers

314 search results - page 34 / 63
» Computing all Suboptimal Alignments in Linear Space
Sort
View
TII
2010
113views Education» more  TII 2010»
13 years 2 months ago
An Automated Framework for Formal Verification of Timed Continuous Petri Nets
In this paper, we develop an automated framework for formal verification of timed continuous Petri nets (ContPNs). Specifically, we consider two problems: (1) given an initial set ...
Marius Kloetzer, Cristian Mahulea, Calin Belta, Ma...
IAT
2007
IEEE
14 years 1 months ago
A Distributed Algorithm for Finding Nucleolus-Stable Payoff Divisions
The agents in multiagent systems can coordinate their actions and handle tasks jointly by forming coalitions. One of the important steps in this process is the fair division of pa...
Hrishikesh J. Goradia, José M. Vidal
EDBT
2009
ACM
184views Database» more  EDBT 2009»
14 years 2 months ago
Distributed similarity search in high dimensions using locality sensitive hashing
In this paper we consider distributed K-Nearest Neighbor (KNN) search and range query processing in high dimensional data. Our approach is based on Locality Sensitive Hashing (LSH...
Parisa Haghani, Sebastian Michel, Karl Aberer
CIVR
2009
Springer
212views Image Analysis» more  CIVR 2009»
14 years 2 months ago
Video copy detection by fast sequence matching
Sequence matching techniques are effective for comparing two videos. However, existing approaches suffer from demanding computational costs and thus are not scalable for large-sca...
Mei-Chen Yeh, Kwang-Ting Cheng
ICPR
2002
IEEE
14 years 8 months ago
Prototype Selection for Finding Efficient Representations of Dissimilarity Data
The nearest neighbor (NN) rule is a simple and intuitive method for solving classification problems. Originally, it uses distances to the complete training set. It performs well, ...
Elzbieta Pekalska, Robert P. W. Duin