Sciweavers

12825 search results - page 2148 / 2565
» Improved PLSOM algorithm
Sort
View
COMPGEOM
2007
ACM
15 years 10 months ago
An optimal generalization of the centerpoint theorem, and its extensions
We prove an optimal generalization of the centerpoint theorem: given a set P of n points in the plane, there exist two points (not necessarily among input points) that hit all con...
Saurabh Ray, Nabil H. Mustafa
ICLP
2010
Springer
15 years 10 months ago
Learning Domain-Specific Heuristics for Answer Set Solvers
In spite of the recent improvements in the performance of Answer Set Programming (ASP) solvers, when the search space is sufficiently large, it is still possible for the search al...
Marcello Balduccini
PODC
2010
ACM
15 years 10 months ago
Brief announcement: tree decomposition for faster concurrent data structures
We show how to partition data structures representable by directed acyclic graphs, i.e. rooted trees, to allow for efficient complex operations, which lie beyond inserts, deletes ...
Johannes Schneider, Roger Wattenhofer
SIGIR
2010
ACM
15 years 10 months ago
Hierarchical pitman-yor language model for information retrieval
In this paper, we propose a new application of Bayesian language model based on Pitman-Yor process for information retrieval. This model is a generalization of the Dirichlet distr...
Saeedeh Momtazi, Dietrich Klakow
CTRSA
2009
Springer
106views Cryptology» more  CTRSA 2009»
15 years 10 months ago
Communication-Efficient Private Protocols for Longest Common Subsequence
We design communication efficient two-party and multi-party protocols for the longest common subsequence (LCS) and related problems. Our protocols achieve privacy with respect to p...
Matthew K. Franklin, Mark Gondree, Payman Mohassel
« Prev « First page 2148 / 2565 Last » Next »