Sciweavers

1399 search results - page 98 / 280
» New Algorithms for k-Center and Extensions
Sort
View
DCOSS
2008
Springer
13 years 11 months ago
Multi-root, Multi-Query Processing in Sensor Networks
Sensor networks can be viewed as large distributed databases, and SQL-like high-level declarative languages can be used for data and information retrieval. Energy constraints make ...
Zhiguo Zhang, Ajay D. Kshemkalyani, Sol M. Shatz
WWIC
2010
Springer
193views Communications» more  WWIC 2010»
14 years 1 months ago
0day Anomaly Detection Made Possible Thanks to Machine Learning
Abstract. This paper proposes new cognitive algorithms and mechanisms for detecting 0day attacks targeting the Internet and its communication performances and behavior. For this pu...
Philippe Owezarski, Johan Mazel, Yann Labit
EDBT
2009
ACM
113views Database» more  EDBT 2009»
14 years 3 months ago
Query ranking in probabilistic XML data
Twig queries have been extensively studied as a major fragment of XPATH queries to query XML data. In this paper, we study PXMLRANK query, (Q, k), which is to rank top-k probabili...
Lijun Chang, Jeffrey Xu Yu, Lu Qin
JMLR
2006
93views more  JMLR 2006»
13 years 9 months ago
An Efficient Implementation of an Active Set Method for SVMs
We propose an active set algorithm to solve the convex quadratic programming (QP) problem which is the core of the support vector machine (SVM) training. The underlying method is ...
Katya Scheinberg
CAV
2005
Springer
104views Hardware» more  CAV 2005»
14 years 2 months ago
Expand, Enlarge and Check... Made Efficient
Abstract. The coverability problem is decidable for the class of wellstructured transition systems. Until recently, the only known algorithm to solve this problem was based on symb...
Gilles Geeraerts, Jean-François Raskin, Lau...