Sciweavers

244 search results - page 45 / 49
» A Linear Search Strategy using Bounds
Sort
View
TON
2010
147views more  TON 2010»
13 years 7 months ago
Coverage-time optimization for clustered wireless sensor networks: a power-balancing approach
—In this paper, we investigate the maximization of the coverage time for a clustered wireless sensor network (WSN) by optimal balancing of power consumption among cluster heads (...
Tao Shu, Marwan Krunz
ICDM
2009
IEEE
111views Data Mining» more  ICDM 2009»
14 years 3 months ago
A Game Theoretical Model for Adversarial Learning
Abstract—It is now widely accepted that in many situations where classifiers are deployed, adversaries deliberately manipulate data in order to reduce the classifier’s accura...
Wei Liu, Sanjay Chawla
LICS
2008
IEEE
14 years 2 months ago
A Neutral Approach to Proof and Refutation in MALL
We propose a setting in which the search for a proof of B or a refutation of B (a proof of ¬B) can be carried out simultaneously: this is in contrast to the usual approach in aut...
Olivier Delande, Dale Miller
PVLDB
2010
103views more  PVLDB 2010»
13 years 7 months ago
Fast Optimal Twig Joins
In XML search systems twig queries specify predicates on node values and on the structural relationships between nodes, and a key operation is to join individual query node matche...
Nils Grimsmo, Truls Amundsen Bjørklund, Mag...
FOCS
2008
IEEE
13 years 8 months ago
Market Equilibria in Polynomial Time for Fixed Number of Goods or Agents
We consider markets in the classical Arrow-Debreu model. There are n agents and m goods. Each buyer has a concave utility function (of the bundle of goods he/she buys) and an init...
Nikhil R. Devanur, Ravi Kannan