Sciweavers

15254 search results - page 37 / 3051
» A k
Sort
View
GRAPHICSINTERFACE
2003
14 years 11 months ago
Easy Realignment of k-DOP Bounding Volumes
In this paper we reconsider pairwise collision detection for rigid motions using a k-DOP bounding volume hierarchy. This data structure is particularly attractive because it is eq...
Christoph Fünfzig, Dieter W. Fellner
JCO
2008
134views more  JCO 2008»
14 years 9 months ago
On minimum m -connected k -dominating set problem in unit disc graphs
Minimum m-connected k-dominating set problem is as follows: Given a graph G = (V,E) and two natural numbers m and k, find a subset S V of minimal size such that every vertex in V ...
Weiping Shang, F. Frances Yao, Peng-Jun Wan, Xiaod...
JCST
2008
85views more  JCST 2008»
14 years 9 months ago
A General Approach to L ( h, k )-Label Interconnection Networks
d Abstract) Tiziana Calamoneri 1 , Saverio Caminiti 2 , and Rossella Petreschi 3 Dipartimento di Informatica Universit`a degli Studi di Roma "La Sapienza" Via Salaria 113...
Tiziana Calamoneri, Saverio Caminiti, Rossella Pet...
72
Voted
SIGIR
2002
ACM
14 years 9 months ago
Study of category score algorithms for k-NN classifier
: This paper analyzes category score algorithms for k-NN classifier found in the literature, including majority voting algorithm (MVA), simple sum algorithm (SSA), etc. MVA and SS...
Huaizhong Kou, Georges Gardarin
84
Voted
PVLDB
2010
140views more  PVLDB 2010»
14 years 8 months ago
Optimal Top-K Query Evaluation for Weighted Business Processes
A Business Process (BP for short) consists of a set of activities that achieve some business goal when combined in a flow. Among all the (maybe infinitely many) possible executi...
Daniel Deutch, Tova Milo, Neoklis Polyzotis, Tom Y...