Sciweavers

7006 search results - page 930 / 1402
» Approximation Algorithms
Sort
View
PVLDB
2010
110views more  PVLDB 2010»
15 years 6 months ago
Graph Homomorphism Revisited for Graph Matching
In a variety of emerging applications one needs to decide whether a graph G matches another Gp, i.e., whether G has a topological structure similar to that of Gp. The traditional ...
Wenfei Fan, Jianzhong Li, Shuai Ma, Hongzhi Wang, ...
TCOM
2010
167views more  TCOM 2010»
15 years 6 months ago
On distributed scheduling in wireless networks exploiting broadcast and network coding
—In this paper, we consider cross-layer optimization in wireless networks with wireless broadcast advantage, focusing on the problem of distributed scheduling of broadcast links....
Tao Cui, Lijun Chen, Tracey Ho
TKDE
2010
199views more  TKDE 2010»
15 years 6 months ago
Probabilistic Reverse Nearest Neighbor Queries on Uncertain Data
—Uncertain data is inherent in various important applications and reverse nearest neighbor (RNN) query is an important query type for many applications. While many different type...
Muhammad Aamir Cheema, Xuemin Lin, Wei Wang 0011, ...
WALCOM
2010
IEEE
221views Algorithms» more  WALCOM 2010»
15 years 6 months ago
Variants of Spreading Messages
In a distributed computing environment a faulty node could lead other nodes in the system to behave in a faulty manor. An initial set of faults could make all the nodes in the syst...
T. V. Thirumala Reddy, D. Sai Krishna, C. Pandu Ra...
ICGI
2010
Springer
15 years 5 months ago
Exact DFA Identification Using SAT Solvers
Abstract. We present an exact algorithm for identification of deterministic finite automata (DFA) which is based on satisfiability (SAT) solvers. Despite the size of the low level ...
Marijn J. H. Heule, Sicco Verwer