Sciweavers

2463 search results - page 217 / 493
» Rankings of Directed Graphs
Sort
View
IPL
2006
115views more  IPL 2006»
15 years 3 months ago
Approximate maximum weight branchings
We consider a special subgraph of a weighted directed graph: one comprising only the k heaviest edges incoming to each vertex. We show that the maximum weight branching in this su...
Amitabha Bagchi, Ankur Bhargava, Torsten Suel
JUCS
2002
123views more  JUCS 2002»
15 years 3 months ago
Synchronization and Stability of Finite Automata
: Let G = (V, E) be a strongly connected and aperiodic directed graph of uniform out-degree k. A deterministic finite automaton is obtained if the edges are colored with k colors i...
Jarkko Kari
VLDB
2004
ACM
161views Database» more  VLDB 2004»
16 years 3 months ago
Supporting top-k join queries in relational databases
Ranking queries produce results that are ordered on some computed score. Typically, these queries involve joins, where users are usually interested only in the top-k join results....
Ihab F. Ilyas, Walid G. Aref, Ahmed K. Elmagarmid
231
Voted
SIGMOD
2009
ACM
190views Database» more  SIGMOD 2009»
16 years 3 months ago
DataLens: making a good first impression
When a database query has a large number of results, the user can only be shown one page of results at a time. One popular approach is to rank results such that the "best&quo...
Bin Liu, H. V. Jagadish
SIGMOD
2007
ACM
229views Database» more  SIGMOD 2007»
16 years 3 months ago
Spark: top-k keyword query in relational databases
With the increasing amount of text data stored in relational databases, there is a demand for RDBMS to support keyword queries over text data. As a search result is often assemble...
Yi Luo, Xuemin Lin, Wei Wang 0011, Xiaofang Zhou