Sciweavers

2194 search results - page 19 / 439
» Improving HLRTA*( k )
Sort
View
ICDE
2008
IEEE
336views Database» more  ICDE 2008»
15 years 8 days ago
Dominant Graph: An Efficient Indexing Structure to Answer Top-K Queries
Given a record set D and a query score function F, a top-k query returns k records from D, whose values of function F on their attributes are the highest. In this paper, we investi...
Lei Zou, Lei Chen 0002
ESCAPE
2007
Springer
256views Algorithms» more  ESCAPE 2007»
14 years 2 months ago
A More Effective Linear Kernelization for Cluster Editing
In the NP-hard Cluster Editing problem, we have as input an undirected graph G and an integer k 0. The question is whether we can transform G, by inserting and deleting at most k ...
Jiong Guo
ENDM
2007
96views more  ENDM 2007»
13 years 11 months ago
Sub-Ramsey Numbers for Arithmetic Progressions and Schur Triples
For a given positive integer k, sr(m, k) denotes the minimal positive integer such that every coloring of [n], n ≥ sr(m, k), that uses each color at most k times, yields a rainb...
Jacob Fox, Veselin Jungic, Rados Radoicic
PRL
2006
94views more  PRL 2006»
13 years 10 months ago
Improving visual evoked potential feature classification for person recognition using PCA and normalization
In earlier papers, it was shown that recognizing persons using their brain patterns evoked during visual stimulus is possible. In this paper, several modifications are proposed to...
Ramaswamy Palaniappan, K. V. R. Ravi
PODC
2010
ACM
14 years 2 months ago
Brief announcement: improving social-network-based sybil-resilient node admission control
We present Gatekeeper, a decentralized protocol that performs Sybil-resilient node admission control based on a social network. Gatekeeper can admit most honest nodes while limiti...
Nguyen Tran, Jinyang Li, Lakshminarayanan Subraman...