Sciweavers

3267 search results - page 436 / 654
» Generalized quasirandom graphs
Sort
View
ISAAC
2009
Springer
140views Algorithms» more  ISAAC 2009»
16 years 1 months ago
Tighter Approximation Bounds for Minimum CDS in Wireless Ad Hoc Networks
Abstract. Connected dominating set (CDS) has a wide range of applications in wireless ad hoc networks. A number of approximation algorithms for constructing a small CDS in wireless...
Minming Li, Peng-Jun Wan, F. Frances Yao
SOCO
2009
Springer
16 years 1 months ago
Lazy Composition of Representations in Java
Abstract. The separation of concerns has been a core idiom of software engineering for decades. In general, software can be decomposed properly only according to a single concern, ...
Rémi Douence, Xavier Lorca, Nicolas Loriant
SIGIR
2009
ACM
16 years 1 months ago
A graph-based approach to mining multilingual word associations from wikipedia
In this paper, we propose a graph-based approach to constructing a multilingual association dictionary from Wikipedia, in which we exploit two kinds of links in Wikipedia articles...
Zheng Ye, Xiangji Huang, Hongfei Lin
ICDIM
2007
IEEE
16 years 28 days ago
Exploiting multi-evidence from multiple user's interests to personalizing information retrieval
The goal of personalization in information retrieval is to tailor the search engine results to the specific goals, preferences and general interests of the users. We propose a no...
Lynda Tamine-Lechani, Mohand Boughanem, Nesrine Ze...
AINA
2007
IEEE
16 years 26 days ago
Grid-Aware Evaluation of Regular Path Queries on Spatial Networks
Regular path queries (RPQs), expressed as regular expressions over the alphabet of database edge-labels, are commonly used for guided navigation of graph databases. While convenie...
Zhuo Miao, Dan C. Stefanescu, Alex Thomo