4199 search results - page 822 / 840 » Generalizing Data in Natural Language |
DATE
2002
IEEE
14 years 13 days ago
2002
IEEE
Microprocessors are today getting more and more inefficient for a growing range of applications. Its principles -The Von Neumann paradigm[3]- based on the sequential execution of ...
MM
2009
ACM
14 years 5 days ago
2009
ACM
This paper presents an efficient, personalizable and yet completely automatic algorithm for enhancing the brightness, tonal balance, and contrast of faces in thumbnails of online...
CIKM
2009
Springer
14 years 4 days ago
2009
Springer
This paper describes a hidden Markov model (HMM) based approach to perform search interface segmentation. Automatic processing of an interface is a must to access the invisible co...
FOCS
2000
IEEE
13 years 12 months ago
2000
IEEE
We consider the planar point location problem from the perspective of expected search time. We are given a planar polygonal subdivision S and for each polygon of the subdivision t...
STOC
2010
ACM
13 years 11 months ago
2010
ACM
Dynamic graph connectivity algorithms have been studied for many years, but typically in the most general possible setting, where the graph can evolve in completely arbitrary ways...