Sciweavers

1446 search results - page 53 / 290
» Similarity of Cardinal Directions
Sort
View
SIAMCOMP
1998
114views more  SIAMCOMP 1998»
13 years 9 months ago
Maximum k-Chains in Planar Point Sets: Combinatorial Structure and Algorithms
A chain of a set P of n points in the plane is a chain of the dominance order on P. A k-chain is a subset C of P that can be covered by k chains. A k-chain C is a maximum k-chain ...
Stefan Felsner, Lorenz Wernisch
TPDS
1998
122views more  TPDS 1998»
13 years 9 months ago
Managing Statistical Behavior of Large Data Sets in Shared-Nothing Architectures
—Increasingly larger data sets are being stored in networked architectures. Many of the available data structures are not easily amenable to parallel realizations. Hashing scheme...
Isidore Rigoutsos, Alex Delis
GECCO
2009
Springer
104views Optimization» more  GECCO 2009»
14 years 4 months ago
Sustaining diversity using behavioral information distance
Conventional similarity metrics used to sustain diversity in evolving populations are not well suited to sequential decision tasks. Genotypes and phenotypic structure are poor pre...
Faustino J. Gomez
SIGMOD
2004
ACM
163views Database» more  SIGMOD 2004»
14 years 10 months ago
Rank-aware Query Optimization
Ranking is an important property that needs to be fully supported by current relational query engines. Recently, several rank-join query operators have been proposed based on rank...
Ihab F. Ilyas, Rahul Shah, Walid G. Aref, Jeffrey ...
CORR
2011
Springer
205views Education» more  CORR 2011»
13 years 1 months ago
Algorithms for Implicit Hitting Set Problems
A hitting set for a collection of sets is a set that has a nonempty intersection with each set in the collection; the hitting set problem is to find a hitting set of minimum card...
Karthekeyan Chandrasekaran, Richard Karp, Erick Mo...