1729 search results - page 298 / 346 » Bound Graph Polysemy |
157
click to vote
BIRTHDAY
2010
Springer
15 years 6 months ago
2010
Springer
Many natural problems in computer science concern structures like graphs where elements are not inherently ordered. In contrast, Turing machines and other common models of computa...
159
click to vote
JSA
2007
15 years 4 months ago
2007
Mapping of applications on a Multiprocessor System-on-Chip (MP-SoC) is a crucial step to optimize performance, energy and memory constraints at the same time. The problem is formu...
155
click to vote
PODC
2011
ACM
14 years 7 months ago
2011
ACM
In this paper we study the problem of building a connected dominating set with constant degree (CCDS) in the dual graph radio network model [4,9,10]. This model includes two types...
135
click to vote
ICCV
1999
IEEE
16 years 6 months ago
1999
IEEE
Using a saliency measure based on the global property of contour closure, we have developed a method that reliably segments out salient contours bounding unknown objects from real...
136
click to vote
ICML
2006
IEEE
16 years 5 months ago
2006
IEEE
The power and popularity of kernel methods stem in part from their ability to handle diverse forms of structured inputs, including vectors, graphs and strings. Recently, several m...