3008 search results - page 192 / 602 » Independence in connected graphs |
141
click to vote
WG
2005
Springer
16 years 1 days ago
2005
Springer
The NP-complete Closest 4-Leaf Power problem asks, given an undirected graph, whether it can be modified by at most edge insertions or deletions such that it becomes a 4-leaf powe...
165
click to vote
TRECVID
2008
15 years 8 months ago
2008
We studied a method using support vector machines (SVMs) with walk-based graph kernels for the high-level feature extraction (HLF) task. In this method, each image is first segmen...
192
click to vote
WABI
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. The orientation of physical networks is a prime task in deciphering the signaling-regulatory circuitry of the cell. One manifestation of this computational task is as a m...
185
click to vote
CHI
2010
ACM
15 years 11 months ago
2010
ACM
We present a tangible user interface (TUI) called Tangible Graph Builder, that has been designed to allow visually impaired users to access graph and chart-based data. We describe...
171
click to vote
ICPP
1999
IEEE
15 years 11 months ago
1999
IEEE
Task graph scheduling has been found effective in performance prediction and optimization of parallel applications. A number of static scheduling algorithms have been proposed for...