Sciweavers

10608 search results - page 290 / 2122
» Complexity of O'Hara's Algorithm
Sort
View
106
Voted
NIPS
2008
15 years 2 months ago
Scalable Algorithms for String Kernels with Inexact Matching
We present a new family of linear time algorithms based on sufficient statistics for string comparison with mismatches under the string kernels framework. Our algorithms improve t...
Pavel P. Kuksa, Pai-Hsi Huang, Vladimir Pavlovic
TSMC
2008
172views more  TSMC 2008»
15 years 15 days ago
AdaBoost-Based Algorithm for Network Intrusion Detection
Abstract--Network intrusion detection aims at distinguishing the attacks on the Internet from normal use of the Internet. It is an indispensable part of the information security sy...
Weiming Hu, Wei Hu, Stephen J. Maybank
120
Voted
SIGMOD
2011
ACM
206views Database» more  SIGMOD 2011»
14 years 3 months ago
Sampling based algorithms for quantile computation in sensor networks
We study the problem of computing approximate quantiles in large-scale sensor networks communication-efficiently, a problem previously studied by Greenwald and Khana [12] and Shri...
Zengfeng Huang, Lu Wang, Ke Yi, Yunhao Liu
113
Voted
SARA
2009
Springer
15 years 5 months ago
Light Algorithms for Maintaining Max-RPC During Search
Abstract. This article presents two new algorithms whose purpose is to maintain the Max-RPC domain filtering consistency during search with a minimal memory footprint and implemen...
Julien Vion, Romuald Debruyne
JGAA
2006
127views more  JGAA 2006»
15 years 17 days ago
A New Algorithm for Finding Minimal Cycle-Breaking Sets of Turns in a Graph
We consider the problem of constructing a minimal cycle-breaking set of turns for a given undirected graph. This problem is important for deadlock-free wormhole routing in compute...
Lev B. Levitin, Mark G. Karpovsky, Mehmet Mustafa,...