Sciweavers

4781 search results - page 68 / 957
» Complexity at large
Sort
View
IMC
2010
ACM
15 years 5 months ago
Temporally oblivious anomaly detection on large networks using functional peers
Previous methods of network anomaly detection have focused on defining a temporal model of what is "normal," and flagging the "abnormal" activity that does not...
Kevin M. Carter, Richard Lippmann, Stephen W. Boye...
165
Voted
AAAI
2007
15 years 9 months ago
Complexity Boundaries for Horn Description Logics
Horn description logics (Horn-DLs) have recently started to attract attention due to the fact that their (worst-case) data complexities are in general lower than their overall (i....
Markus Krötzsch, Sebastian Rudolph, Pascal Hi...
CVPR
2007
IEEE
16 years 9 months ago
Solving Large Scale Binary Quadratic Problems: Spectral Methods vs. Semidefinite Programming
In this paper we introduce two new methods for solving binary quadratic problems. While spectral relaxation methods have been the workhorse subroutine for a wide variety of comput...
Carl Olsson, Anders P. Eriksson, Fredrik Kahl
ICDE
2007
IEEE
119views Database» more  ICDE 2007»
16 years 1 months ago
Practical Preference Relations for Large Data Sets
User-defined preferences allow personalized ranking of query results. A user provides a declarative specification of his/her preferences, and the system is expected to use that ...
Kenneth A. Ross, Peter J. Stuckey, Amélie M...
ARITH
2005
IEEE
16 years 1 months ago
Fast Modular Reduction for Large Wordlengths via One Linear and One Cyclic Convolution
Abstract— Modular reduction is a fundamental operation in cryptographic systems. Most well known modular reduction methods including Barrett’s and Montgomery’s algorithms lev...
Dhananjay S. Phatak, Tom Goff