Sciweavers

3047 search results - page 94 / 610
» Randomized Parallel Selection
Sort
View
STACS
2005
Springer
14 years 3 months ago
Worst-Case and Average-Case Approximations by Simple Randomized Search Heuristics
Abstract. In recent years, probabilistic analyses of algorithms have received increasing attention. Despite results on the average-case complexity and smoothed complexity of exact ...
Carsten Witt
EMNLP
2008
13 years 11 months ago
Revealing the Structure of Medical Dictations with Conditional Random Fields
Automatic processing of medical dictations poses a significant challenge. We approach the problem by introducing a statistical framework capable of identifying types and boundarie...
Jeremy Jancsary, Johannes Matiasek, Harald Trost
ICPR
2008
IEEE
14 years 4 months ago
Template selection for on-line signature verification
In this paper, we propose two effective methods to perform automatic template selection where the goal is to select prototype signature templates for a user from a given set of on...
Ningning Liu, Yunhong Wang
LATIN
1998
Springer
14 years 2 months ago
The CREW PRAM Complexity of Modular Inversion
One of the long-standing open questions in the theory of parallel computation is the parallel complexity of the integer gcd and related problems, such as modular inversion. We pres...
Joachim von zur Gathen, Igor Shparlinski
TCS
1998
13 years 9 months ago
ERCW PRAMs and Optical Communication
This paper presents algorithms and lower bounds for several fundamental problems on the Exclusive Read, Concurrent Write Parallel Random Access Machine (ERCW PRAM) and some result...
Philip D. MacKenzie, Vijaya Ramachandran