Sciweavers

6142 search results - page 944 / 1229
» The Complexity of Partition Functions
Sort
View
FOCS
2005
IEEE
16 years 8 days ago
The Closest Substring problem with small distances
In the CLOSEST SUBSTRING problem k strings s1, ..., sk are given, and the task is to find a string s of length L such that each string si has a consecutive substring of length L ...
Dániel Marx
ICDM
2005
IEEE
142views Data Mining» more  ICDM 2005»
16 years 8 days ago
Shortest-Path Kernels on Graphs
Data mining algorithms are facing the challenge to deal with an increasing number of complex objects. For graph data, a whole toolbox of data mining algorithms becomes available b...
Karsten M. Borgwardt, Hans-Peter Kriegel
ICIP
2005
IEEE
16 years 8 days ago
Automatic registration of 3D datasets using Gaussian fields
—In this paper we introduce a new 3D automatic registration method based on Gaussian fields and energy minimization. The method defines a simple ∞ C energy function, which is c...
Faysal Boughorbel, Andreas Koschan, Mongi A. Abidi
ICRA
2005
IEEE
148views Robotics» more  ICRA 2005»
16 years 8 days ago
Bearing-only SLAM Using a SPRT Based Gaussian Sum Filter
— Use of a Gaussian Sum filter (GSF) to efficiently solve the initialisation problem in bearing-only simultaneous localisation and mapping (SLAM) is the main contribution of th...
Ngai Ming Kwok, Gamini Dissanayake, Q. P. Ha
ISCAS
2005
IEEE
144views Hardware» more  ISCAS 2005»
16 years 8 days ago
Impact of multicycled scheduling on power-area tradeoffs in behavioural synthesis
— Multicycling is a widely investigated technique for performance optimisation in behavioural synthesis. It allows an operation to execute over two or more control steps with the...
M. A. Ochoa-Montiel, Bashir M. Al-Hashimi, Peter K...