Sciweavers

306 search results - page 25 / 62
» On the Minimal Uncompletable Word Problem
Sort
View
ICCTA
2007
IEEE
14 years 1 months ago
Covering a Set of Points in a Plane Using Two Parallel Rectangles
We consider the problem of finding two parallel rectangles, in arbitrary orientation, covering a given set of n points in a plane, such that the area of the larger rectangle is m...
Chandan Saha, Sandip Das
SIAMJO
2008
139views more  SIAMJO 2008»
13 years 7 months ago
An Augmented Primal-Dual Method for Linear Conic Programs
We propose a new iterative approach for solving linear programs over convex cones. Assuming that Slaters condition is satisfied, the conic problem is transformed to the minimizatio...
Florian Jarre, Franz Rendl
IPPS
2009
IEEE
14 years 2 months ago
On the complexity of mapping pipelined filtering services on heterogeneous platforms
In this paper, we explore the problem of mapping filtering services on large-scale heterogeneous platforms. Two important optimization criteria should be considered in such a fra...
Anne Benoit, Fanny Dufossé, Yves Robert
EMNLP
2004
13 years 8 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
SCL
2011
12 years 10 months ago
Regularity issues for the null-controllability of the linear 1-d heat equation
The fact that the heat equation is controllable to zero in any bounded domain of the euclidean space, any time T > 0 and from any open subset of the boundary is well known. On ...
Sorin Micu, Enrique Zuazua