Sciweavers

3305 search results - page 622 / 661
» Can we Rely on SQL
Sort
View
ADHOC
2010
173views more  ADHOC 2010»
13 years 4 months ago
A new distributed topology control algorithm for wireless environments with non-uniform path loss and multipath propagation
Each node in a wireless multi-hop network can adjust the power level at which it transmits and thus change the topology of the network to save energy by choosing the neighbors wit...
Harish Sethu, Thomas Gerety
TCOM
2011
130views more  TCOM 2011»
13 years 2 months ago
Indirect Reciprocity Game Modelling for Cooperation Stimulation in Cognitive Networks
—In cognitive networks, since nodes generally belong to different authorities and pursue different goals, they will not cooperate with others unless cooperation can improve their...
Yan Chen, K. J. Ray Liu
EDBT
2011
ACM
199views Database» more  EDBT 2011»
12 years 11 months ago
Finding closed frequent item sets by intersecting transactions
Most known frequent item set mining algorithms work by enumerating candidate item sets and pruning infrequent candidates. An alternative method, which works by intersecting transa...
Christian Borgelt, Xiaoyuan Yang, Rubén Nog...
ICCV
2011
IEEE
12 years 7 months ago
Informative Feature Selection for Object Recognition via Sparse PCA
Bag-of-words (BoW) methods are a popular class of object recognition methods that use image features (e.g., SIFT) to form visual dictionaries and subsequent histogram vectors to r...
Nikhil Naikal, Allen Y. Yang, S. Shankar Sastry
CCS
2011
ACM
12 years 7 months ago
PaperSpeckle: microscopic fingerprinting of paper
Paper forgery is among the leading causes of corruption in many developing regions [2]. In this paper, we introduce PaperSpeckle, a robust system that leverages the natural random...
Ashlesh Sharma, Lakshminarayanan Subramanian, Eric...