Sciweavers

1918 search results - page 85 / 384
» Discovering Cortical Algorithms
Sort
View
TODS
2002
76views more  TODS 2002»
14 years 9 months ago
Searching for dependencies at multiple abstraction levels
g for Dependencies at Multiple Abstraction Levels Toon Calders Raymond T. Ng Jef Wijsen The notion of roll-up dependency (RUD) extends functional dependencies with generalization ...
Toon Calders, Raymond T. Ng, Jef Wijsen
WWW
2004
ACM
15 years 10 months ago
A hierarchical monothetic document clustering algorithm for summarization and browsing search results
Organizing Web search results into a hierarchy of topics and subtopics facilitates browsing the collection and locating results of interest. In this paper, we propose a new hierar...
Krishna Kummamuru, Rohit Lotlikar, Shourya Roy, Ka...
TDSC
2008
83views more  TDSC 2008»
14 years 9 months ago
A Precise Termination Condition of the Probabilistic Packet Marking Algorithm
The probabilistic packet marking (PPM) algorithm is a promising way to discover the Internet map or an attack graph that the attack packets traversed during a distributed denial-of...
T. Y. Wong, Man Hon Wong, John C. S. Lui
MOBIHOC
2007
ACM
15 years 9 months ago
Approximation algorithms for longest-lived directional multicast communications in WANETs
Several centralized and distributed algorithms have been recently proposed to maximize the multicast lifetime for directional communications in wireless ad-hoc networks. Their per...
Song Guo, Oliver W. W. Yang, Victor C. M. Leung
GECCO
2004
Springer
116views Optimization» more  GECCO 2004»
15 years 3 months ago
A Comment on Opt-AiNET: An Immune Network Algorithm for Optimisation
Verifying the published results of algorithms is part of the usual research process. This helps to both validate the existing literature, but also quite often allows for new insigh...
Jon Timmis, Camilla Edmonds