Sciweavers

363 search results - page 18 / 73
» Partial Multicuts in Trees
Sort
View
SSPR
2004
Springer
14 years 3 months ago
Matching Concavity Trees
Concavity trees are structures for 2-D shape representation. In this paper, we present a new recursive method for concavity tree matching that returns the distance between two attr...
Ossama El Badawy, Mohamed Kamel
FPGA
1999
ACM
142views FPGA» more  FPGA 1999»
14 years 2 months ago
Multi-Terminal Net Routing for Partial Crossbar-Based Multi-FPGA Systems
Multi-FPGA systems are used as custom computing machines to solve compute intensive problems and also in the verification and prototyping of large circuits. In this paper, we addr...
Abdel Ejnioui, N. Ranganathan
FLAIRS
2001
13 years 11 months ago
Extracting Partial Structures from HTML Documents
The new wrapper model for extractiong text data from HTML documents is introduced. The Kushmerick's wrapper class (Kusshmerick 2000) may be unsuccessful in the case that suff...
Hiroshi Sakamoto, Yoshitsugu Murakami, Hiroki Arim...
CIKM
2007
Springer
14 years 4 months ago
Evaluation of partial path queries on xml data
XML query languages typically allow the specification of structural patterns of elements. Finding the occurrences of such patterns in an XML tree is the key operation in XML quer...
Stefanos Souldatos, Xiaoying Wu, Dimitri Theodorat...
AMAI
1999
Springer
13 years 9 months ago
STCSP - Structured Temporal Constraint satisfaction Problems
Temporal Constraint Satisfaction Problems (TCSP) is a well known approach for representing and processing temporal knowledge. Important properties of the knowledge can be inferred...
Mira Balaban, Tzachi Rosen