1887 search results - page 213 / 378 » An efficient search algorithm for partially ordered sets |
ISAAC
2003
Springer
14 years 2 months ago
2003
Springer
Abstract. We define an algorithm for determining, in a linear number of symbolic steps, the biconnected components of a graph implicitly represented with Ordered Binary Decision D...
NIPS
2004
13 years 10 months ago
2004
We describe an algorithm for support vector machines (SVM) that can be parallelized efficiently and scales to very large problems with hundreds of thousands of training vectors. I...
WWW
2008
ACM
14 years 10 months ago
2008
ACM
In this paper, we propose a novel unsupervised approach to query segmentation, an important task in Web search. We use a generative query model to recover a query's underlyin...
3DOR
2009
13 years 10 months ago
2009
The objective of the Shape Retrieval Contest '09 (SHREC'09) of Partial Models is to compare the performances of algorithms that accept a range image as the query and ret...
ACSC
2002
IEEE
14 years 2 months ago
2002
IEEE
We propose a flow-sensitive alias analysis algorithm that computes safe and efficient alias sets in Java. For that, we propose a references-set representation of aliased elements,...