Sciweavers

1547 search results - page 284 / 310
» Solving Knapsack Problems in a Sticker Based Model
Sort
View
SPW
2000
Springer
15 years 6 months ago
The Resurrecting Duckling - What Next?
In the context of the security of wireless ad hoc networks, we previously explored the problem of secure transient association between a master and a slave device in the absence of...
Frank Stajano
140
Voted
CORR
2010
Springer
201views Education» more  CORR 2010»
14 years 12 months ago
Online Advertisement, Optimization and Stochastic Networks
In this paper, we propose a stochastic model to describe how search service providers charge client companies based on users' queries for the keywords related to these compan...
R. Srikant
SIGMOD
2010
ACM
324views Database» more  SIGMOD 2010»
15 years 7 months ago
Similarity search and locality sensitive hashing using ternary content addressable memories
Similarity search methods are widely used as kernels in various data mining and machine learning applications including those in computational biology, web search/clustering. Near...
Rajendra Shinde, Ashish Goel, Pankaj Gupta, Debojy...
126
Voted
GLOBECOM
2007
IEEE
15 years 8 months ago
Minimum Coverage Breach and Maximum Network Lifetime in Wireless Sensor Networks
—Network lifetime is a critical issue in Wireless Sensor Networks. It is possible to extend network lifetime by organizing the sensors into a number of sensor covers. However, wi...
Chen Wang, My T. Thai, Yingshu Li, Feng Wang 0002,...
FAW
2007
Springer
110views Algorithms» more  FAW 2007»
15 years 8 months ago
Maximizing the Number of Independent Labels in the Plane
In this paper, we consider a map labeling problem to maximize the number of independent labels in the plane. We first investigate the point labeling model that each label can be ...
Kuen-Lin Yu, Chung-Shou Liao, Der-Tsai Lee