Sciweavers

2223 search results - page 339 / 445
» Ontological Framework for Approximation
Sort
View
WISE
2002
Springer
15 years 9 months ago
Applying the Site Information to the Information Retrieval from the Web
In recent years, several information retrieval methods using information about the Web-links are developed, such as HITS and Trawling. In order to analyze the Web-links dividing i...
Yasuhito Asano, Hiroshi Imai, Masashi Toyoda, Masa...
CCS
2006
ACM
15 years 8 months ago
Evading network anomaly detection systems: formal reasoning and practical techniques
Attackers often try to evade an intrusion detection system (IDS) when launching their attacks. There have been several published studies in evasion attacks, some with available to...
Prahlad Fogla, Wenke Lee
ATAL
2010
Springer
15 years 4 months ago
Local search for distributed asymmetric optimization
Distributed Constraints Optimization (DCOP) is a powerful framework for representing and solving distributed combinatorial problems, where the variables of the problem are owned b...
Alon Grubshtein, Roie Zivan, Tal Grinshpoun, Amnon...
DATAMINE
2006
89views more  DATAMINE 2006»
15 years 4 months ago
Scalable Clustering Algorithms with Balancing Constraints
Clustering methods for data-mining problems must be extremely scalable. In addition, several data mining applications demand that the clusters obtained be balanced, i.e., be of ap...
Arindam Banerjee, Joydeep Ghosh
TSP
2008
101views more  TSP 2008»
15 years 4 months ago
Bayesian Compressive Sensing
The data of interest are assumed to be represented as N-dimensional real vectors, and these vectors are compressible in some linear basis B, implying that the signal can be recons...
Shihao Ji, Ya Xue, Lawrence Carin