5128 search results - page 825 / 1026 » Discrete Component Analysis |
198
click to vote
STOC
2010
ACM
15 years 11 months ago
2010
ACM
The Steiner tree problem is one of the most fundamental ÆÈ-hard problems: given a weighted undirected graph and a subset of terminal nodes, find a minimum weight tree spanning ...
191
click to vote
ICDT
2010
ACM
15 years 11 months ago
2010
ACM
The paper formulates and investigates the aggregation problem for synthesized mediators of Web services (SWMs). An SWM is a finite-state transducer defined in terms of templates...
184
click to vote
SIGMOD
2010
ACM
15 years 11 months ago
2010
ACM
Modern maps provide a variety of information about roads and their surrounding landscape allowing navigation systems to go beyond simple shortest path computation. In this demo, w...
210
click to vote
IWVF
2001
Springer
15 years 11 months ago
2001
Springer
Volumetric images of small mortar samples under load are acquired by X-ray microtomography. The images are binarized at many different threshold values, and over a million connecte...
166
click to vote
ISSTA
2000
ACM
15 years 11 months ago
2000
ACM
A number of different concepts have been proposed that, loosely speaking, revolve around the notion of software testability. Indeed, the concept of testability itself has been int...