Sciweavers

1095 search results - page 116 / 219
» Preprocessing of Intractable Problems
Sort
View
JSA
1998
74views more  JSA 1998»
13 years 10 months ago
Windowed active sampling for reliable neural learning
The composition of the example set has a major impact on the quality of neural learning. The popular approach is focused on extensive preprocessing to bridge the representation ga...
Emilia I. Barakova, Lambert Spaanenburg
MST
2010
106views more  MST 2010»
13 years 8 months ago
Constrained-Path Labellings on Graphs of Bounded Clique-Width
Given a graph G we consider the problem of preprocessing it so that given two vertices x,y and a set X of vertices, we can efficiently report the shortest path (or just its length...
Bruno Courcelle, Andrew Twigg
GI
2009
Springer
13 years 8 months ago
Direct Multi-Target Tracking and Multisensor Fusion Using Antenna Arrays
: This paper investigates a direct Target Motion Analysis (TMA) estimator for the problem of calculating the states (i.e. source positions, velocities, etc.) of multiple sources fr...
Marc Oispuu
ICDE
2009
IEEE
143views Database» more  ICDE 2009»
13 years 8 months ago
Incremental Reverse Nearest Neighbor Ranking
In this paper, we formalize the novel concept of incremental reverse nearest neighbor ranking and suggest an original solution for this problem. We propose an efficient approach fo...
Hans-Peter Kriegel, Peer Kröger, Matthias Ren...
GRID
2010
Springer
13 years 7 months ago
Parallel SAT Solving on Peer-to-Peer Desktop Grids
Abstract Satciety is a distributed parallel satisfiability (SAT) solver which focuses on tackling the domainspecific problems inherent to one of the most challenging environments f...
Sven Schulz, Wolfgang Blochinger