Sciweavers

15073 search results - page 2827 / 3015
» Probabilistic algorithms for computing resultants
Sort
View
124
Voted
CCS
2006
ACM
15 years 5 months ago
A scalable approach to attack graph generation
Attack graphs are important tools for analyzing security vulnerabilities in enterprise networks. Previous work on attack graphs has not provided an account of the scalability of t...
Xinming Ou, Wayne F. Boyer, Miles A. McQueen
CSR
2006
Springer
15 years 5 months ago
Fast Motif Search in Protein Sequence Databases
Regular expression pattern matching is widely used in computational biology. Searching through a database of sequences for a motif (a simple regular expression), or its variations...
Elena Zheleva, Abdullah N. Arslan
KDD
2000
ACM
149views Data Mining» more  KDD 2000»
15 years 5 months ago
Efficient clustering of high-dimensional data sets with application to reference matching
Many important problems involve clustering large datasets. Although naive implementations of clustering are computationally expensive, there are established efficient techniques f...
Andrew McCallum, Kamal Nigam, Lyle H. Ungar
117
Voted
EENERGY
2010
15 years 5 months ago
Energy saving and network performance: a trade-off approach
Power consumption of the Information and Communication Technology sector (ICT) has recently become a key challenge. In particular, actions to improve energy-efficiency of Internet...
Carla Panarello, Alfio Lombardo, Giovanni Schembra...
AIPS
2008
15 years 4 months ago
Learning Relational Decision Trees for Guiding Heuristic Planning
The current evaluation functions for heuristic planning are expensive to compute. In numerous domains these functions give good guidance on the solution, so it worths the computat...
Tomás de la Rosa, Sergio Jiménez, Da...
« Prev « First page 2827 / 3015 Last » Next »