Sciweavers

10289 search results - page 53 / 2058
» Standard bases in K
Sort
View
SIAMCOMP
1998
114views more  SIAMCOMP 1998»
15 years 5 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
ICALP
2010
Springer
15 years 11 months ago
Testing Non-uniform k-Wise Independent Distributions over Product Spaces
A discrete distribution D over Σ1 × · · · × Σn is called (non-uniform) k-wise independent if for any set of k indexes {i1, . . . , ik} and for any z1 ∈ Σi1 , . . . , zk ...
Ronitt Rubinfeld, Ning Xie
CORR
2008
Springer
167views Education» more  CORR 2008»
15 years 6 months ago
Fast k Nearest Neighbor Search using GPU
Statistical measures coming from information theory represent interesting bases for image and video processing tasks such as image retrieval and video object tracking. For example...
Vincent Garcia, Eric Debreuve, Michel Barlaud
ICDE
2009
IEEE
169views Database» more  ICDE 2009»
16 years 7 months ago
Visible Reverse k-Nearest Neighbor Queries
Reverse nearest neighbor (RNN) queries have a broad application base such as decision support, profile-based marketing, resource allocation, data mining, etc. Previous work on RNN ...
Yunjun Gao, Baihua Zheng, Gencai Chen, Wang-Chien ...
SIGMOD
2008
ACM
214views Database» more  SIGMOD 2008»
16 years 6 months ago
A graph method for keyword-based selection of the top-K databases
While database management systems offer a comprehensive solution to data storage, they require deep knowledge of the schema, as well as the data manipulation language, in order to...
Quang Hieu Vu, Beng Chin Ooi, Dimitris Papadias, A...