Sciweavers

3946 search results - page 399 / 790
» The computational complexity of choice sets
Sort
View
COLCOM
2007
IEEE
15 years 9 months ago
A random projection approach to subscription covering detection in publish/subscribe systems
Abstract—Subscription covering detection is useful to improving the performance of any publish/subscribe system. However, an exact solution to querying coverings among a large se...
Duc A. Tran, Thinh Nguyen
ACL
1996
15 years 9 months ago
From Submit to Submitted via Submission: On Lexical Rules in Large-Scale Lexicon Acquisition
This paper deals with the discovery, representation, and use of lexical rules (LRs) during large-scale semi-automatic computational lexicon acquisition. The analysis is based on a...
Evelyne Viegas, Boyan A. Onyshkevych, Victor Raski...
CORR
2007
Springer
182views Education» more  CORR 2007»
15 years 7 months ago
Triangulating the Real Projective Plane
We consider the problem of computing a triangulation of the real projective plane P2 , given a finite point set P = {p1, p2, . . . , pn} as input. We prove that a triangulation of...
Mridul Aanjaneya, Monique Teillaud
CVPR
2011
IEEE
15 years 2 months ago
Proposal Generation for Object Detection using Cascaded Ranking SVMs
Object recognition has made great strides recently. However, the best methods, such as those based on kernelSVMs are highly computationally intensive. The problem of how to accele...
Ziming Zhang, Jonathan Warrell, Philip Torr
SAC
2005
ACM
16 years 1 months ago
A hybrid approach for multiresolution modeling of large-scale scientific data
Simulations of complex scientific phenomena involve the execution of massively parallel computer programs. These simulation programs generate large-scale multidimensional data set...
Tina Eliassi-Rad, Terence Critchlow