158 search results - page 28 / 32 » A Self-stabilizing Algorithm for Graph Searching in Trees |
121
Voted
RECOMB
2007
Springer
16 years 3 months ago
2007
Springer
Molecular interaction databases can be used to study the evolution of molecular pathways across species. Querying such pathways is a challenging computational problem, and recent e...
160
click to vote
SIGMOD
2005
ACM
15 years 9 months ago
2005
ACM
In this paper, we propose new graph-based data structure and indexing to organize and retrieve video data. Several researches have shown that a graph can be a better candidate for...
97
Voted
ICDE
2009
IEEE
15 years 10 months ago
2009
IEEE
— Keyword search on relational databases provides users with insights that they can not easily observe using the traditional RDBMS techniques. Here, an l-keyword query is speciï¬...
119
Voted
WINE
2005
Springer
15 years 8 months ago
2005
Springer
We study the complexity issues for Walrasian equilibrium in a special case of combinatorial auction, called single-minded auction, in which every participant is interested in only ...
100
Voted
AGILE
2009
Springer
15 years 10 months ago
2009
Springer
We study a point pattern detection problem on networks, motivated by geographical analysis tasks, such as crime hotspot detection. Given a network N (for example, a street, train,...