Sciweavers

2600 search results - page 68 / 520
» Clustering with or without the Approximation
Sort
View
SAC
2008
ACM
14 years 9 months ago
Efficient concept clustering for ontology learning using an event life cycle on the web
Ontology learning integrates many complementary techniques, including machine learning, natural language processing, and data mining. Specifically, clustering techniques facilitat...
Sangsoo Sung, Seokkyung Chung, Dennis McLeod
ICUMT
2009
14 years 7 months ago
Free-CLASH - improved localization-free clustering in large wireless sensor networks
This paper investigates topology management of large wireless sensor networks. Due to their random deployment, nodes have to organize themselves as energy efficient as possible to ...
Jakob Salzmann, Ralf Behnke, Jiaxi You, Dirk Timme...
DISOPT
2006
118views more  DISOPT 2006»
14 years 9 months ago
Improved bounds for vehicle routing solutions
We present lower bounds for the vehicle routing problem (VRP) with and without split deliveries, improving the well known bound of Haimovich and Rinnooy Kan. These bounds are then...
Agustín Bompadre, Moshe Dror, James B. Orli...
FOCS
2005
IEEE
15 years 3 months ago
On Non-Approximability for Quadratic Programs
This paper studies the computational complexity of the following type of quadratic programs: given an arbitrary matrix whose diagonal elements are zero, find x ∈ {−1, +1}n th...
Sanjeev Arora, Eli Berger, Elad Hazan, Guy Kindler...
ACSAC
2001
IEEE
15 years 1 months ago
Mining Alarm Clusters to Improve Alarm Handling Efficiency
It is a well-known problem that intrusion detection systems overload their human operators by triggering thousands of alarms per day. As a matter of fact, we have been asked by on...
Klaus Julisch