Sciweavers

1022 search results - page 204 / 205
» New models and algorithms for programmable networks
Sort
View
ISAAC
2004
Springer
112views Algorithms» more  ISAAC 2004»
13 years 11 months ago
Dynamic Tree Cross Products
Abstract. Range searching over tree cross products – a variant of classic range searching – recently has been introduced by Buchsbaum et al. (Proc. 8th ESA, vol. 1879 of LNCS, ...
Marcus Raitner
SIGMOD
2010
ACM
324views Database» more  SIGMOD 2010»
13 years 11 months ago
Similarity search and locality sensitive hashing using ternary content addressable memories
Similarity search methods are widely used as kernels in various data mining and machine learning applications including those in computational biology, web search/clustering. Near...
Rajendra Shinde, Ashish Goel, Pankaj Gupta, Debojy...
KDD
2010
ACM
272views Data Mining» more  KDD 2010»
13 years 10 months ago
Beyond heuristics: learning to classify vulnerabilities and predict exploits
The security demands on modern system administration are enormous and getting worse. Chief among these demands, administrators must monitor the continual ongoing disclosure of sof...
Mehran Bozorgi, Lawrence K. Saul, Stefan Savage, G...
CIKM
2008
Springer
13 years 8 months ago
Learning a two-stage SVM/CRF sequence classifier
Learning a sequence classifier means learning to predict a sequence of output tags based on a set of input data items. For example, recognizing that a handwritten word is "ca...
Guilherme Hoefel, Charles Elkan
ECOOP
2008
Springer
13 years 8 months ago
Programming with Live Distributed Objects
A component revolution is underway, bringing developers improved productivity and opportunities for code reuse. However, whereas existing tools work well for builders of desktop ap...
Krzysztof Ostrowski, Ken Birman, Danny Dolev, Jong...