Sciweavers

3250 search results - page 579 / 650
» Parameterized Learning Complexity
Sort
View
IMC
2010
ACM
15 years 1 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...
IPPS
2010
IEEE
15 years 1 months ago
Offline library adaptation using automatically generated heuristics
Automatic tuning has emerged as a solution to provide high-performance libraries for fast changing, increasingly complex computer architectures. We distinguish offline adaptation (...
Frédéric de Mesmay, Yevgen Voronenko...
NAACL
2010
15 years 1 months ago
An Efficient Algorithm for Easy-First Non-Directional Dependency Parsing
We present a novel deterministic dependency parsing algorithm that attempts to create the easiest arcs in the dependency structure first in a non-directional manner. Traditional d...
Yoav Goldberg, Michael Elhadad
DMIN
2009
121views Data Mining» more  DMIN 2009»
15 years 29 days ago
Data Mining in the Real World: Experiences, Challenges, and Recommendations
Abstract - Data mining is used regularly in a variety of industries and is continuing to gain in both popularity and acceptance. However, applying data mining methods to complex re...
Gary M. Weiss
EMNLP
2009
15 years 29 days ago
Improving Web Search Relevance with Semantic Features
Most existing information retrieval (IR) systems do not take much advantage of natural language processing (NLP) techniques due to the complexity and limited observed effectivenes...
Yumao Lu, Fuchun Peng, Gilad Mishne, Xing Wei, Ben...