3708 search results - page 130 / 742 » Approximating Betweenness Centrality |
110
click to vote
ICDE
2010
IEEE
16 years 4 months ago
2010
IEEE
Abstract-- We consider the Top-k Approximate Subtree Matching (TASM) problem: finding the k best matches of a small query tree, e.g., a DBLP article with 15 nodes, in a large docum...
173
Voted
COCO
1994
Springer
15 years 9 months ago
1994
Springer
A probabilistically checkable debate system (PCDS) for a language L consists of a probabilisticpolynomial-time veri er V and a debate between Player 1, who claims that the input x ...
143
click to vote
SGP
2003
15 years 6 months ago
2003
We present an algorithm for meshing surfaces that is a simple adaptation of a greedy “farthest point” technique proposed by Chew. Given a surface S, it progressively adds poin...
151
Voted
ATAL
2010
Springer
15 years 6 months ago
2010
Springer
Distributed Constraint Optimization (DCOP) is a popular framework for cooperative multi-agent decision making. DCOP is NPhard, so an important line of work focuses on developing f...
150
click to vote
CAD
2006
Springer
2006
Springer
An efficient, error-bounded approximation algorithm for simulating quasi-statics of complex linkages
15 years 5 months ago
Design and analysis of articulated mechanical structures, commonly referred to as linkages, is an integral part of any CAD/CAM system. The most common approaches formulate the pro...