5592 search results - page 985 / 1119 » On Random Betweenness Constraints |
161
Voted
SPAA
2003
ACM
15 years 10 months ago
2003
ACM
In the minimum path coloring problem, we are given a graph and a set of pairs of vertices of the graph and we are asked to connect the pairs by colored paths in such a way that pa...
134
Voted
FPGA
2003
ACM
15 years 10 months ago
2003
ACM
We present a pipelining-aware router for FPGAs. The problem of routing pipelined signals is different from the conventional FPGA routing problem. For example, the two terminal N-D...
167
click to vote
COOPIS
2002
IEEE
15 years 10 months ago
2002
IEEE
This paper presents a specifically database-inspired approach (called DOGMA) for engineering formal ontologies, implemented as shared resources used to express agreed formal semant...
160
click to vote
CDC
2009
IEEE
15 years 9 months ago
2009
IEEE
— We consider the problem of determining the existence of known constant signals over a set of sites, given noisy measurements obtained by a team of active sensors that can switc...
150
click to vote
MICCAI
2001
Springer
15 years 9 months ago
2001
Springer
Abstract. This paper describes a new segmentation technique for multidimensional dynamic data. One example of such data is a perfusion sequence where a number of 3D MRI volumes sho...