Sciweavers

3946 search results - page 560 / 790
» The computational complexity of choice sets
Sort
View
CORR
2011
Springer
172views Education» more  CORR 2011»
15 years 1 months ago
Improving Strategies via SMT Solving
We consider the problem of computing numerical invariants of programs by abstract interpretation. Our method eschews two traditional sources of imprecision: (i) the use of widenin...
Thomas Martin Gawlitza, David Monniaux
COLING
2010
15 years 1 months ago
Exploring the Data-Driven Prediction of Prepositions in English
Prepositions in English are a well-known challenge for language learners, and the computational analysis of preposition usage has attracted significant attention. Such research ge...
Anas Elghafari, Detmar Meurers, Holger Wunsch
SIAMREV
2010
170views more  SIAMREV 2010»
15 years 1 months ago
Network Properties Revealed through Matrix Functions
The newly emerging field of Network Science deals with the tasks of modelling, comparing and summarizing large data sets that describe complex interactions. Because pairwise affin...
Ernesto Estrada, Desmond J. Higham
TNN
2010
176views Management» more  TNN 2010»
15 years 1 months ago
Sparse approximation through boosting for learning large scale kernel machines
Abstract--Recently, sparse approximation has become a preferred method for learning large scale kernel machines. This technique attempts to represent the solution with only a subse...
Ping Sun, Xin Yao
CVPR
2012
IEEE
13 years 9 months ago
Real-time scene text localization and recognition
An end-to-end real-time scene text localization and recognition method is presented. The real-time performance is achieved by posing the character detection problem as an efficie...
Lukas Neumann, Jiri Matas