Sciweavers

1983 search results - page 66 / 397
» Competitive graph searches
Sort
View
WWW
2009
ACM
14 years 8 months ago
Unsupervised query categorization using automatically-built concept graphs
Automatic categorization of user queries is an important component of general purpose (Web) search engines, particularly for triggering rich, query-specific content and sponsored ...
Eustache Diemert, Gilles Vandelle
WIOPT
2005
IEEE
14 years 1 months ago
Optimal Controlled Flooding Search in a Large Wireless Network
In this paper we consider the problem of searching for a node or an object (i.e., piece of data, file, etc.) in a large wireless network. We consider the class of controlled flo...
Nicholas B. Chang, Mingyan Liu
WADS
2001
Springer
126views Algorithms» more  WADS 2001»
14 years 6 days ago
On External-Memory Planar Depth First Search
Even though a large number of I/O-efficient graph algorithms have been developed, a number of fundamental problems still remain open. For example, no space- and I/O-efficient algo...
Lars Arge, Ulrich Meyer, Laura Toma, Norbert Zeh
ICDM
2006
IEEE
81views Data Mining» more  ICDM 2006»
14 years 1 months ago
Full Perfect Extension Pruning for Frequent Graph Mining
Mining graph databases for frequent subgraphs has recently developed into an area of intensive research. Its main goals are to reduce the execution time of the existing basic algo...
Christian Borgelt, Thorsten Meinl
CP
2006
Springer
13 years 11 months ago
Constraint Programming Models for Graceful Graphs
The problem of finding a graceful labelling of a graph, or proving that the graph is not graceful, has previously been modelled as a CSP. A new and much faster CSP model of the pro...
Barbara M. Smith