Sciweavers

4137 search results - page 485 / 828
» On the number of matchings of a tree
Sort
View
FUZZIEEE
2007
IEEE
16 years 1 months ago
FrIDA - A Free Intelligent Data Analysis Toolbox
—This paper describes a Java-based graphical user interface to a large number of data analysis programs the first author has written in C over the years. In addition, this toolb...
Christian Borgelt, Gil Gonzáles-Rodrí...
ICC
2007
IEEE
16 years 1 months ago
Fault-Tolerant Manycast to Mobile Destinations in Sensor Networks
Manycast is a group communication primitive wherein the source is required to send data packets to a certain number of a given set of destinations. In this article, we design faul...
Xianjin Zhu, Himanshu Gupta
IPPS
2007
IEEE
16 years 1 months ago
Probability Convergence in a Multithreaded Counting Application
The problem of counting specified combinations of a given set of variables arises in many statistical and data mining applications. To solve this problem, we introduce the PDtree...
Chad Scherrer, Nathaniel Beagley, Jarek Nieplocha,...
APPROX
2007
Springer
99views Algorithms» more  APPROX 2007»
16 years 1 months ago
Small Approximate Pareto Sets for Bi-objective Shortest Paths and Other Problems
We investigate the problem of computing a minimum set of solutions that approximates within a specified accuracy the Pareto curve of a multiobjective optimization problem. We show...
Ilias Diakonikolas, Mihalis Yannakakis
ATVA
2007
Springer
152views Hardware» more  ATVA 2007»
16 years 1 months ago
Bounded Synthesis
Abstract. The bounded synthesis problem is to construct an implementation that satisfies a given temporal specification and a given bound on the number of states. We present a so...
Sven Schewe, Bernd Finkbeiner