Sciweavers

7379 search results - page 1197 / 1476
» How Many Clusters
Sort
View
CPAIOR
2010
Springer
15 years 2 months ago
Lazy Clause Generation: Combining the Power of SAT and CP (and MIP?) Solving
Finite domain propagation solving, the basis of constraint programming (CP) solvers, allows building very high-level models of problems, and using highly specific inference encapsu...
Peter J. Stuckey
ECAI
2010
Springer
15 years 2 months ago
From bursty patterns to bursty facts: The effectiveness of temporal text mining for news
Many document collections are by nature dynamic, evolving as the topics or events they describe change. The goal of temporal text mining is to discover bursty patterns and to ident...
Ilija Subasic, Bettina Berendt
GAMESEC
2010
136views Game Theory» more  GAMESEC 2010»
15 years 2 months ago
Effective Multimodel Anomaly Detection Using Cooperative Negotiation
Abstract. Many computer protection tools incorporate learning techniques that build mathematical models to capture the characteristics of system's activity and then check whet...
Alberto Volpatto, Federico Maggi, Stefano Zanero
GIS
2010
ACM
15 years 2 months ago
Kernelized map matching
Map matching is a fundamental operation in many applications such as traffic analysis and location-aware services, the killer apps for ubiquitous computing. In the past, several m...
Ahmed Jawad, Kristian Kersting
GLOBECOM
2010
IEEE
15 years 2 months ago
Modeling and Analysis for Reactive-Decision Spectrum Handoff in Cognitive Radio Networks
This paper investigates how to characterize the effect of multiple spectrum handoff delay on the extended data delivery time of the secondary users' connections in cognitive r...
Chung-Wei Wang, Li-Chun Wang, Fumiyuki Adachi
« Prev « First page 1197 / 1476 Last » Next »