562 search results - page 102 / 113 » Simple Randomized Algorithms for Closest Pair Problems |
CIKM
2008
Springer
13 years 10 months ago
2008
Springer
Most prior work on information extraction has focused on extracting information from text in digital documents. However, often, the most important information being reported in an...
ISPD
2000
ACM
14 years 25 days ago
2000
ACM
modules can be handled in constraint graphs efficiently. This Floorplan area minimization is an important problem because many modules have shape flexibilities during the floorplan...
SIGGRAPH
1999
ACM
14 years 23 days ago
1999
ACM
We present a new method for user controlled morphing of two homeomorphic triangle meshes of arbitrary topology. In particular we focus on the problem of establishing a corresponde...
DASFAA
2007
IEEE
14 years 2 months ago
2007
IEEE
Twig pattern matching problem has been widely studied in recent years. Give an XML tree T . A twig-pattern matching query, Q, represented as a query tree, is to find all the occur...
WWW
2006
ACM
14 years 9 months ago
2006
ACM
Expanding a seed set into a larger community is a common procedure in link-based analysis. We show how to adapt recent results from theoretical computer science to expand a seed s...