Sciweavers

2009 search results - page 215 / 402
» Dense Interest Points
Sort
View
TALG
2008
69views more  TALG 2008»
15 years 4 months ago
Testing Euclidean minimum spanning trees in the plane
Given a Euclidean graph G over a set P of n points in the plane, we are interested in verifying whether G is a Euclidean minimum spanning tree (EMST) of P or G differs from it in ...
Artur Czumaj, Christian Sohler
TASLP
2008
105views more  TASLP 2008»
15 years 4 months ago
Optimizing the Performance of Spoken Language Recognition With Discriminative Training
The performance of spoken language recognition system is typically formulated to reflect the detection cost and the strategic decision points along the detection-error-tradeoff cur...
Donglai Zhu, Haizhou Li, Bin Ma, Chin-Hui Lee
TCS
2008
15 years 4 months ago
A unified approach to finding good stable matchings in the hospitals/residents setting
The hospitals/residents (HR) problem is a many-to-one generalization of the stable marriage (SM) problem. Researchers have been interested in variants of stable matchings that eit...
Christine Cheng, Eric McDermid, Ichiro Suzuki
IVC
2007
90views more  IVC 2007»
15 years 4 months ago
Numerical residues
Binary morphological transformations based on the residues (ultimate erosion, skeleton by openings, etc.) are extended to functions by means of the transformation definition and o...
Serge Beucher
JC
2007
96views more  JC 2007»
15 years 4 months ago
Error linear complexity measures for multisequences
Complexity measures for sequences over finite fields, such as the linear complexity and the k-error linear complexity, play an important role in cryptology. Recent developments ...
Wilfried Meidl, Harald Niederreiter, Ayineedi Venk...