Sciweavers

10988 search results - page 1859 / 2198
» Algorithmic Folding Complexity
Sort
View
PAKDD
2005
ACM
112views Data Mining» more  PAKDD 2005»
16 years 27 days ago
Approximated Clustering of Distributed High-Dimensional Data
In many modern application ranges high-dimensional feature vectors are used to model complex real-world objects. Often these objects reside on different local sites. In this paper,...
Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, ...
WABI
2005
Springer
124views Bioinformatics» more  WABI 2005»
16 years 26 days ago
Reconstructing Metabolic Networks Using Interval Analysis
Recently, there has been growing interest in the modelling and simulation of biological systems. Such systems are often modelled in terms of coupled ordinary differential equation...
Warwick Tucker, Vincent Moulton
WINE
2005
Springer
122views Economy» more  WINE 2005»
16 years 26 days ago
Walrasian Equilibrium: Hardness, Approximations and Tractable Instances
We study the complexity issues for Walrasian equilibrium in a special case of combinatorial auction, called single-minded auction, in which every participant is interested in only ...
Ning Chen, Atri Rudra
ASPDAC
2004
ACM
107views Hardware» more  ASPDAC 2004»
16 years 25 days ago
Minimization of the expected path length in BDDs based on local changes
— In many verification tools methods for functional simulation based on reduced ordered Binary Decision Diagrams (BDDs) are used. The evaluation time for a BDD can be crucial an...
Rüdiger Ebendt, Wolfgang Günther, Rolf D...
ASPDAC
2004
ACM
120views Hardware» more  ASPDAC 2004»
16 years 25 days ago
Temporal floorplanning using 3D-subTCG
Improving logic capacity by time-sharing, dynamically reconfigurable FPGAs are employed to handle designs of high complexity and functionality. In this paper, we use a novel topo...
Ping-Hung Yuh, Chia-Lin Yang, Yao-Wen Chang, Hsin-...
« Prev « First page 1859 / 2198 Last » Next »