Sciweavers

8294 search results - page 1234 / 1659
» Presenting Data from Experiments in Algorithmics
Sort
View
KDD
2004
ACM
139views Data Mining» more  KDD 2004»
16 years 6 months ago
Machine learning for online query relaxation
In this paper we provide a fast, data-driven solution to the failing query problem: given a query that returns an empty answer, how can one relax the query's constraints so t...
Ion Muslea
CCS
2003
ACM
15 years 11 months ago
Monitoring and early warning for internet worms
After the Code Red incident in 2001 and the SQL Slammer in January 2003, it is clear that a simple self-propagating worm can quickly spread across the Internet, infects most vulne...
Cliff Changchun Zou, Lixin Gao, Weibo Gong, Donald...
TKDE
2008
125views more  TKDE 2008»
15 years 6 months ago
Discovering and Explaining Abnormal Nodes in Semantic Graphs
An important problem in the area of homeland security is to identify abnormal or suspicious entities in large datasets. Although there are methods from data mining and social netwo...
Shou-de Lin, Hans Chalupsky
CADE
2007
Springer
16 years 6 months ago
Towards Efficient Satisfiability Checking for Boolean Algebra with Presburger Arithmetic
Boolean Algebra with Presburger Arithmetic (BAPA) is a decidable logic that combines 1) Boolean algebra of sets of uninterpreted elements (BA) and 2) Presburger arithmetic (PA). BA...
Viktor Kuncak, Martin C. Rinard
IPPS
2010
IEEE
15 years 4 months ago
A distributed diffusive heuristic for clustering a virtual P2P supercomputer
Abstract--For the management of a virtual P2P supercomputer one is interested in subgroups of processors that can communicate with each other efficiently. The task of finding these...
Joachim Gehweiler, Henning Meyerhenke
« Prev « First page 1234 / 1659 Last » Next »