Sciweavers

1140 search results - page 38 / 228
» Progress on Certifying Algorithms
Sort
View
COLING
1990
14 years 4 days ago
A Type-theoretical Analysis of Complex Verb Generation
Tense and aspect, together with mood and modality, usually form the entangled structure of a complex verb. They are often hard to translate by machines, because of both syntactic ...
Satoshi Tojo
ISSAC
2007
Springer
105views Mathematics» more  ISSAC 2007»
14 years 5 months ago
Certification of the QR factor R and of lattice basis reducedness
Given a lattice basis of n vectors in Zn, we propose an algorithm using 12n3 + O(n2) floating point operations for checking whether the basis is LLL-reduced. If the basis is redu...
Gilles Villard
CAGD
2006
103views more  CAGD 2006»
13 years 11 months ago
The implicit structure of ridges of a smooth parametric surface
Given a smooth surface, a blue (red) ridge is a curve such that at each of its points, the maximum (minimum) principal curvature has an extremum along its curvature line. Ridges a...
Frédéric Cazals, Jean-Charles Faug&e...
ANOR
2006
69views more  ANOR 2006»
13 years 11 months ago
A splitting method for stochastic programs
This paper derives a new splitting-based decomposition algorithm for convex stochastic programs. It combines certain attractive features of the progressive hedging algorithm of Roc...
Teemu Pennanen, Markku Kallio
WALCOM
2010
IEEE
290views Algorithms» more  WALCOM 2010»
14 years 6 months ago
The Covert Set-Cover Problem with Application to Network Discovery
We address a version of the set-cover problem where we do not know the sets initially (and hence referred to as covert) but we can query an element to find out which sets contain ...
Sandeep Sen, V. N. Muralidhara