7259 search results - page 208 / 1452 » From Fields to Trees |
295
click to vote
ICDE
2009
IEEE
16 years 7 months ago
2009
IEEE
A common approach to performing keyword search over relational databases is to find the minimum Steiner trees in database graphs. These methods, however, are rather expensive as th...
156
click to vote
ICIP
2008
IEEE
16 years 7 months ago
2008
IEEE
In this paper we carry out cooperatively both disparity and object boundary estimation by setting the two tasks in a unified Markovian framework. We introduce a new joint probabil...
187
Voted
ICCAD
1999
IEEE
15 years 10 months ago
1999
IEEE
The minimum rectilinear Steiner tree (RST) problem is one of the fundamental problems in the field of electronic design automation. The problem is NP-hard, and much work has been ...
145
click to vote
CMOT
2004
15 years 5 months ago
2004
Social action is situated in fields that are simultaneously composed of interpersonal ties and relations among organizations, which are both usefully characterized as social netwo...
150
click to vote
ESA
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. We show that optimal alphabetic binary trees can be constructed in O(n) time if the elements of the initial sequence are drawn from a domain that can be sorted in linear ...