85 search results - page 15 / 17 » Scaling limit of random k-trees |
172
click to vote
MICRO
2008
IEEE
16 years 24 days ago
2008
IEEE
Heavyweight security analysis systems, such as taint analysis and dynamic type checking, are powerful technologies used to detect security vulnerabilities and software bugs. Tradi...
175
click to vote
CVPR
2001
IEEE
16 years 8 months ago
2001
IEEE
In this paper we describe a statistical method for the integration of an unlimited number of cues within a deformable model framework. We treat each cue as a random variable, each...
182
click to vote
DAC
2005
ACM
16 years 7 months ago
2005
ACM
As Si CMOS devices are scaled down into the nanoscale regime, current computer architecture approaches are reaching their practical limits. Future nano-architectures will confront...
160
click to vote
WWW
2005
ACM
16 years 7 months ago
2005
ACM
Many modern natural language-processing applications utilize search engines to locate large numbers of Web documents or to compute statistics over the Web corpus. Yet Web search e...
170
click to vote
SDM
2009
SIAM
16 years 3 months ago
2009
SIAM
This paper proposes Twin Vector Machine (TVM), a constant space and sublinear time Support Vector Machine (SVM) algorithm for online learning. TVM achieves its favorable scaling b...