Sciweavers

8647 search results - page 165 / 1730
» The Container Selection Problem
Sort
View
ACL
2008
15 years 4 months ago
Solving Relational Similarity Problems Using the Web as a Corpus
We present a simple linguistically-motivated method for characterizing the semantic relations that hold between two nouns. The approach leverages the vast size of the Web in order...
Preslav Nakov, Marti A. Hearst
CCCG
1993
15 years 4 months ago
Widest-corridor Problems
A k-dense corridor through a finite set, S, of n points in the plane is the open region of the plane that is bounded by two parallel lines that intersect the convex hull of S and ...
Ravi Janardan, Franco P. Preparata
CLASSIFICATION
2008
68views more  CLASSIFICATION 2008»
15 years 3 months ago
The Metric Cutpoint Partition Problem
Let G = (V, E, w) be a graph with vertex and edge sets V and E, respectively, and w : E IR+ a function which assigns a positive weight or length to each edge of G. G is called a r...
Alain Hertz, Sacha Varone
CORR
2006
Springer
120views Education» more  CORR 2006»
15 years 3 months ago
Improved Bounds and Schemes for the Declustering Problem
Abstract. The declustering problem is to allocate given data on parallel working storage devices in such a manner that typical requests find their data evenly distributed among the...
Benjamin Doerr, Nils Hebbinghaus, Sören Werth
COR
2007
97views more  COR 2007»
15 years 3 months ago
Two-stage general block patterns for the two-dimensional cutting problem
This paper presents an algorithm for the unconstrained two-dimensional cutting problem of rectangular pieces. It proposes the two-stage general block pattern that can be cut into ...
Yaodong Cui, Xianquan Zhang