2127 search results - page 286 / 426 » Computing large matchings fast |
125
click to vote
ESWS
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. Finding the optimal selection of an OWL reasoner and service interface for a specific ontology-based application is challenging. Over time it has become more and more di...
131
click to vote
HICSS
2006
IEEE
15 years 10 months ago
2006
IEEE
Bandura’s theories of self- and collective efficacy are widely recognized in many fields, including psychology and management, but have been largely unnoticed by the Human-Compu...
157
click to vote
ICDAR
2003
IEEE
15 years 9 months ago
2003
IEEE
This paper presents a lexical post-processing optimization for handwritten word recognition. The aim of this work is to explore the combination of different lexical postprocessing...
153
Voted
COMPGEOM
2000
ACM
15 years 8 months ago
2000
ACM
We present an (1+ε)-approximation algorithm for computing the minimum-spanning tree of points in a planar arrangement of lines, where the metric is the number of crossings betwee...
133
Voted
ASPDAC
1999
ACM
15 years 8 months ago
1999
ACM
We present a novel formulation, called the WaMPDE, for solving systems with forced autonomous components. An important feature of the WaMPDE is its ability to capture frequency mo...