12783 search results - page 864 / 2557 » Experimenting with computing |
150
click to vote
GD
2009
Springer
16 years 7 days ago
2009
Springer
Abstract. In this paper we propose three layout algorithms for semibipartite graphs—bipartite graphs with edges in one partition—that emerge from microarray experiment analysis...
195
click to vote
GI
2009
Springer
16 years 6 days ago
2009
Springer
: In this paper we present eMir, digital signage (public electronic displays) that show human faces which react to audience emotion. Using a camera installed at the sign, the syste...
180
click to vote
APN
2001
Springer
16 years 3 days ago
2001
Springer
Reachability analysis and simulation tools for high-level nets spend a significant amount of the computing time in performing enabling tests, determining the assignments under whi...
199
click to vote
CC
2001
Springer
16 years 3 days ago
2001
Springer
We study the application of a standard model checker tool, Spin, to the well-known problem of computing a may-alias relation for a C program. A precise may-alias relation can signi...
192
click to vote
EMMCVPR
2001
Springer
16 years 3 days ago
2001
Springer
—Motivated by our recent work on rooted tree matching, in this paper we provide a solution to the problem of matching two free (i.e., unrooted) trees by constructing an associati...