Sciweavers

1456 search results - page 53 / 292
» Improved Randomized Results for That Interval Selection Prob...
Sort
View
CVPR
2007
IEEE
16 years 3 days ago
Optimizing Distribution-based Matching by Random Subsampling
We boost the efficiency and robustness of distributionbased matching by random subsampling which results in the minimum number of samples required to achieve a specified probabili...
Alex Po Leung, Shaogang Gong
EMNLP
2004
14 years 11 months ago
Applying Conditional Random Fields to Japanese Morphological Analysis
This paper presents Japanese morphological analysis based on conditional random fields (CRFs). Previous work in CRFs assumed that observation sequence (word) boundaries were fixed...
Taku Kudo, Kaoru Yamamoto, Yuji Matsumoto
75
Voted
IWANN
2001
Springer
15 years 2 months ago
Using Contextual Information to Selectively Adjust Preprocessing Parameters
Abstract. It is generally accepted that some of the problems and ambiguities at the low level of processing can not be resolved without taking into account contextual expectations....
Predrag Neskovic, Leon N. Cooper
ICALP
2011
Springer
14 years 1 months ago
On the Advice Complexity of the k-Server Problem
Competitive analysis is the established tool for measuring the output quality of algorithms that work in an online environment. Recently, the model of advice complexity has been in...
Hans-Joachim Böckenhauer, Dennis Komm, Rastis...
112
Voted
DAC
2004
ACM
15 years 1 months ago
A methodology to improve timing yield in the presence of process variations
The ability to control the variations in IC fabrication process is rapidly diminishing as feature sizes continue towards the sub-100 nm regime. As a result, there is an increasing...
Sreeja Raj, Sarma B. K. Vrudhula, Janet Meiling Wa...