Sciweavers

14 search results - page 2 / 3
» On Linear Time Minor Tests and Depth First Search
Sort
View
IMSCCS
2006
IEEE
14 years 1 months ago
Quality Assessment of Peptide Tandem Mass Spectra
Background: Tandem mass spectrometry has emerged as a cornerstone of high throughput proteomic studies owing in part to various high throughput search engines which are used to in...
Fang-Xiang Wu, Pierre Gagné, Arnaud Droit, ...
MVA
1990
114views Computer Vision» more  MVA 1990»
13 years 8 months ago
Radar Image Processing for Locating Underground Linear Objects
This paper presents an image processing method for locating underground linear objects using ground-probing radar data. One of the problems when using groundprobing radars is how ...
Toru Kaneko
ICCAD
1999
IEEE
153views Hardware» more  ICCAD 1999»
13 years 11 months ago
Cycle time and slack optimization for VLSI-chips
We consider the problem of finding an optimal clock schedule, i.e. optimal arrival times for clock signals at latches of a VLSI chip. We describe a general model which includes al...
Christoph Albrecht, Bernhard Korte, Jürgen Sc...
ISCI
2007
141views more  ISCI 2007»
13 years 7 months ago
A performance comparison of distance-based query algorithms using R-trees in spatial databases
Efficient processing of distance-based queries (DBQs) is of great importance in spatial databases due to the wide area of applications that may address such queries. The most repr...
Antonio Corral, Jesús Manuel Almendros-Jim&...
ADBIS
2003
Springer
95views Database» more  ADBIS 2003»
14 years 21 days ago
Distance Join Queries of Multiple Inputs in Spatial Databases
Let a tuple of n objects obeying a query graph (QG) be called the n-tuple. The “Ddistance-value” of this n-tuple is the value of a linear function of distances of the n objects...
Antonio Corral, Yannis Manolopoulos, Yannis Theodo...