Sciweavers

1066 search results - page 85 / 214
» Computing Private Set Operations with Linear Complexities
Sort
View
SIAMCOMP
1998
92views more  SIAMCOMP 1998»
14 years 9 months ago
Surface Approximation and Geometric Partitions
Motivated by applications in computer graphics, visualization, and scienti c computation, we study the computational complexity of the following problem: Given a set S of n points...
Pankaj K. Agarwal, Subhash Suri
CORR
2007
Springer
104views Education» more  CORR 2007»
14 years 9 months ago
Sorting and Selection in Posets
Classical problems of sorting and searching assume an underlying linear ordering of the objects being compared. In this paper, we study a more general setting, in which some pairs...
Constantinos Daskalakis, Richard M. Karp, Elchanan...
ICPR
2004
IEEE
15 years 11 months ago
Optimally Regularised Kernel Fisher Discriminant Analysis
Mika et al. [3] introduce a non-linear formulation of Fisher's linear discriminant, based the now familiar "kernel trick", demonstrating state-of-the-art performanc...
Gavin C. Cawley, Kamel Saadi, Nicola L. C. Talbot
JCSS
2010
112views more  JCSS 2010»
14 years 8 months ago
Towards a dichotomy for the Possible Winner problem in elections based on scoring rules
To make a joint decision, agents (or voters) are often required to provide their preferences as linear orders. To determine a winner, the given linear orders can be aggregated acc...
Nadja Betzler, Britta Dorn
SC
2004
ACM
15 years 3 months ago
The Potential of Computation Regrouping for Improving Locality
Improving program locality has become increasingly important on modern computer systems. An effective strategy is to group computations on the same data so that once the data are ...
Chen Ding, Maksim Orlovich