1798 search results - page 123 / 360 » A Tree for All Seasons |
COLING
1996
13 years 10 months ago
1996
This paper studies the computational complexity of disambiguation under probabilistic tree-grammars as in (Bod, 1992; Schabes and Waters, 1993). It presents a proof that the follo...
ICDM
2010
IEEE
13 years 6 months ago
2010
IEEE
Community detection is an important task for mining the structure and function of complex networks. Many pervious approaches are difficult to detect communities with arbitrary size...
ICCAD
2008
IEEE
14 years 6 months ago
2008
IEEE
— In today’s VLSI designs, there can be many blockages in a routing region. The obstacle-avoiding rectilinear Steiner minimum tree (OARSMT) problem has become an important prob...
SENSYS
2009
ACM
14 years 3 months ago
2009
ACM
This paper presents and evaluates two principles for wireless routing protocols. The first is datapath validation: data traffic quickly discovers and fixes routing inconsistenc...
SIGIR
2005
ACM
14 years 2 months ago
2005
ACM
Recognition and retrieval of historical handwritten material is an unsolved problem. We propose a novel approach to recognizing and retrieving handwritten manuscripts, based upon ...