Sciweavers

851 search results - page 165 / 171
» Random constructions and density results
Sort
View
MOBIHOC
2008
ACM
14 years 7 months ago
Localized distance-sensitive service discovery in wireless sensor networks
In this paper, we identify a new problem in wireless sensor networks, distance sensitive service discovery, where nearby or closest service selection guarantee is expected. We pro...
Xu Li, Nicola Santoro, Ivan Stojmenovic
SISAP
2009
IEEE
149views Data Mining» more  SISAP 2009»
14 years 2 months ago
Combinatorial Framework for Similarity Search
—We present an overview of the combinatorial framework for similarity search. An algorithm is combinatorial if only direct comparisons between two pairwise similarity values are ...
Yury Lifshits
GFKL
2007
Springer
152views Data Mining» more  GFKL 2007»
14 years 1 months ago
Supporting Web-based Address Extraction with Unsupervised Tagging
Abstract. The manual acquisition and modeling of tourist information as e.g. addresses of points of interest is time and, therefore, cost intensive. Furthermore, the encoded inform...
Berenike Loos, Chris Biemann
MICRO
2006
IEEE
127views Hardware» more  MICRO 2006»
14 years 1 months ago
A Predictive Performance Model for Superscalar Processors
Designing and optimizing high performance microprocessors is an increasingly difficult task due to the size and complexity of the processor design space, high cost of detailed si...
P. J. Joseph, Kapil Vaswani, Matthew J. Thazhuthav...
FOSSACS
2005
Springer
14 years 27 days ago
Branching Cells as Local States for Event Structures and Nets: Probabilistic Applications
We study the concept of choice for true concurrency models such as prime event structures and safe Petri nets. We propose a dynamic variation of the notion of cluster previously in...
Samy Abbes, Albert Benveniste