Sciweavers

509 search results - page 38 / 102
» Using wikipedia categories for ad hoc search
Sort
View
DIALM
2005
ACM
125views Algorithms» more  DIALM 2005»
14 years 9 days ago
Minimizing interference in ad hoc and sensor networks
Reducing interference is one of the main challenges in wireless communication, and particularly in ad hoc networks. The amount of interference experienced by a node v corresponds ...
Thomas Moscibroda, Roger Wattenhofer
WWW
2007
ACM
14 years 11 months ago
Yago: a core of semantic knowledge
We present YAGO, a light-weight and extensible ontology with high coverage and quality. YAGO builds on entities and relations and currently contains more than 1 million entities a...
Fabian M. Suchanek, Gjergji Kasneci, Gerhard Weiku...
WWW
2010
ACM
14 years 5 months ago
Using landing pages for sponsored search ad selection
We explore the use of the landing page content in sponsored search ad selection. Specifically, we compare the use of the ad’s intrinsic content to augmenting the ad with the wh...
Yejin Choi, Marcus Fontoura, Evgeniy Gabrilovich, ...
MIDDLEWARE
2004
Springer
14 years 3 months ago
A context-aware middleware for applications in mobile Ad Hoc environments
Novel ubiquitous computing applications such as intelligent vehicles, smart buildings, and traffic management require special properties that traditional computing applications d...
Carl-Fredrik Sørensen, Maomao Wu, Thirunavu...
MOBIHOC
2002
ACM
14 years 10 months ago
Message-optimal connected dominating sets in mobile ad hoc networks
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...
Khaled M. Alzoubi, Peng-Jun Wan, Ophir Frieder