Sciweavers

1921 search results - page 341 / 385
» Making AC-3 an Optimal Algorithm
Sort
View
VLDB
2004
ACM
161views Database» more  VLDB 2004»
16 years 2 months ago
Supporting top-k join queries in relational databases
Ranking queries produce results that are ordered on some computed score. Typically, these queries involve joins, where users are usually interested only in the top-k join results....
Ihab F. Ilyas, Walid G. Aref, Ahmed K. Elmagarmid
MOBIHOC
2005
ACM
16 years 1 months ago
Low-coordination topologies for redundancy in sensor networks
Tiny, low-cost sensor devices are expected to be failure-prone and hence in many realistic deployment scenarios for sensor networks these nodes are deployed in higher than necessa...
Rajagopal Iyengar, Koushik Kar, Suman Banerjee
119
Voted
MOBIHOC
2003
ACM
16 years 1 months ago
Lightweight sensing and communication protocols for target enumeration and aggregation
The development of lightweight sensing and communication protocols is a key requirement for designing resource constrained sensor networks. This paper introduces a set of efficien...
Qing Fang, Feng Zhao, Leonidas J. Guibas
SAC
2009
ACM
15 years 9 months ago
An empirical study of incorporating cost into test suite reduction and prioritization
Software developers use testing to gain and maintain confidence in the correctness of a software system. Automated reduction and prioritization techniques attempt to decrease the...
Adam M. Smith, Gregory M. Kapfhammer
104
Voted
CIKM
2009
Springer
15 years 8 months ago
POkA: identifying pareto-optimal k-anonymous nodes in a domain hierarchy lattice
Data generalization is widely used to protect identities and prevent inference of sensitive information during the public release of microdata. The k-anonymity model has been exte...
Rinku Dewri, Indrajit Ray, Indrakshi Ray, Darrell ...