Sciweavers

1522 search results - page 143 / 305
» On the Complexity of Several Haplotyping Problems
Sort
View
DEBS
2007
ACM
14 years 11 months ago
Identification of suspicious, unknown event patterns in an event cloud
This paper describes an approach to detect unknown event patterns. In this context, an event is not only something that happens, but also something that can be analysed. This task...
Alexander Widder, Rainer von Ammon, Philippe Schae...
CVPR
2007
IEEE
15 years 12 months ago
Optimal Dimensionality Discriminant Analysis and Its Application to Image Recognition
Dimensionality reduction is an important issue when facing high-dimensional data. For supervised dimensionality reduction, Linear Discriminant Analysis (LDA) is one of the most po...
Feiping Nie, Shiming Xiang, Yangqiu Song, Changshu...
ECCV
2004
Springer
15 years 12 months ago
Sparse Finite Elements for Geodesic Contours with Level-Sets
Level-set methods have been shown to be an effective way to solve optimisation problems that involve closed curves. They are well known for their capacity to deal with flexible top...
Martin Weber, Andrew Blake, Roberto Cipolla
VLSID
2002
IEEE
177views VLSI» more  VLSID 2002»
15 years 10 months ago
RTL-Datapath Verification using Integer Linear Programming
Satisfiability of complex word-level formulas often arises as a problem in formal verification of hardware designs described at the register transfer level (RTL). Even though most...
Raik Brinkmann, Rolf Drechsler
LATA
2009
Springer
15 years 4 months ago
From Gene Trees to Species Trees through a Supertree Approach
Abstract. Gene trees are leaf-labeled trees inferred from molecular sequences. Due to duplication events arising in genome evolution, gene trees usually have multiple copies of som...
Celine Scornavacca, Vincent Berry, Vincent Ranwez