Sciweavers

1040 search results - page 117 / 208
» Rounding algorithms for covering problems
Sort
View
SIAMCOMP
2008
140views more  SIAMCOMP 2008»
14 years 9 months ago
The Forgetron: A Kernel-Based Perceptron on a Budget
Abstract. The Perceptron algorithm, despite its simplicity, often performs well in online classification tasks. The Perceptron becomes especially effective when it is used in conju...
Ofer Dekel, Shai Shalev-Shwartz, Yoram Singer
SIGMOD
2008
ACM
140views Database» more  SIGMOD 2008»
14 years 9 months ago
Near-optimal algorithms for shared filter evaluation in data stream systems
We consider the problem of evaluating multiple overlapping queries defined on data streams, where each query is a conjunction of multiple filters and each filter may be shared acr...
Zhen Liu, Srinivasan Parthasarathy 0002, Anand Ran...
IJWIN
2006
209views more  IJWIN 2006»
14 years 9 months ago
On Connected Multiple Point Coverage in Wireless Sensor Networks
Abstract-- We consider a wireless sensor network consisting of a set of sensors deployed randomly. A point in the monitored area is covered if it is within the sensing range of a s...
Shuhui Yang, Fei Dai, Mihaela Cardei, Jie Wu, Floy...
NPL
1998
129views more  NPL 1998»
14 years 9 months ago
Extraction of Logical Rules from Neural Networks
A new architecture and method for feature selection and extraction of logical rules from neural networks trained with backpropagation algorithm is presented. The network consists ...
Wlodzislaw Duch, Rafal Adamczak, Krzysztof Grabcze...
WG
2005
Springer
15 years 3 months ago
Hypertree Decompositions: Structure, Algorithms, and Applications
We review the concepts of hypertree decomposition and hypertree width from a graph theoretical perspective and report on a number of recent results related to these concepts. We al...
Georg Gottlob, Martin Grohe, Nysret Musliu, Marko ...