Sciweavers

4302 search results - page 374 / 861
» Index Pairs Algorithms
Sort
View
FSTTCS
2008
Springer
15 years 6 months ago
STCON in Directed Unique-Path Graphs
ABSTRACT. We study the problem of space-efficient polynomial-time algorithms for directed stconnectivity (STCON). Given a directed graph G, and a pair of vertices s, t, the STCON ...
Sampath Kannan, Sanjeev Khanna, Sudeepa Roy
ICCV
2009
IEEE
16 years 10 months ago
Max-Margin Additive Classifiers for Detection
We present methods for training high quality object detectors very quickly. The core contribution is a pair of fast training algorithms for piece-wise linear classifiers, which ...
Subhransu Maji, Alexander C. Berg
VIS
2007
IEEE
120views Visualization» more  VIS 2007»
16 years 6 months ago
Efficient Computation of Morse-Smale Complexes for Three-dimensional Scalar Functions
The Morse-Smale complex is an efficient representation of the gradient behavior of a scalar function, and critical points paired by the complex identify topological features and th...
Attila Gyulassy, Vijay Natarajan, Valerio Pascuc...
ICML
2007
IEEE
16 years 5 months ago
Fast and effective kernels for relational learning from texts
In this paper, we define a family of syntactic kernels for automatic relational learning from pairs of natural language sentences. We provide an efficient computation of such mode...
Alessandro Moschitti, Fabio Massimo Zanzotto
PODS
2006
ACM
108views Database» more  PODS 2006»
16 years 5 months ago
Deterministic k-set structure
A k-set structure over data streams is a bounded-space data structure that supports stream insertion and deletion operations and returns the set of (item, frequency) pairs in the s...
Sumit Ganguly, Anirban Majumder