5606 search results - page 484 / 1122 » Randomization Techniques for Graphs. |
220
click to vote
SPIRE
2005
Springer
16 years 9 days ago
2005
Springer
Proximity searching consists in retrieving from a database, objects that are close to a query. For this type of searching problem, the most general model is the metric space, where...
170
click to vote
VLDB
2005
ACM
16 years 9 days ago
2005
ACM
Relational, XML and HTML data can be represented as graphs with entities as nodes and relationships as edges. Text is associated with nodes and possibly edges. Keyword search on s...
193
click to vote
GG
2004
Springer
16 years 6 days ago
2004
Springer
Refactorings are transformations that change the structure of a program, while preserving the behavior. The topic has attracted a lot of attention recently, since it is a promising...
179
click to vote
CIKM
2003
Springer
16 years 1 days ago
2003
Springer
Traffic analysis, in the context of Telecommunications or Internet and Web data, is crucial for large network operations. Data in such networks is often provided as large graphs w...
165
click to vote
ICASSP
2009
IEEE
15 years 10 months ago
2009
IEEE
We regarded information retrieval as a graph search problem and proposed several novel dialog strategies that can recover from misrecognition through a spoken dialog that traverse...