Sciweavers

VECPAR
2000
Springer
14 years 1 months ago
A Parallel Implementation of an Interior-Point Algorithm for Multicommodity Network Flows
A parallel implementation of the specialized interior-point algorithm for multicommodity network flows introduced in [5] is presented. In this algorithm, the positive definite syst...
Jordi Castro, Antonio Frangioni
HPCN
1997
Springer
14 years 1 months ago
Boolean Function Manipulation on a Parallel System Using BDDs
This paper describes a distributed algorithm for Boolean function manipulation. The algorithm is based on Binary Decision Diagrams (BDDs), which are one of the most commonly used ...
F. Bianchi, Fulvio Corno, Maurizio Rebaudengo, Mat...
CP
1995
Springer
14 years 1 months ago
Asynchronous Weak-commitment Search for Solving Distributed Constraint Satisfaction Problems
A distributed constraint satisfaction problem (Distributed CSP) is a CSP in which variables and constraints are distributed among multiple automated agents, and various application...
Makoto Yokoo
COMPGEOM
1995
ACM
14 years 1 months ago
The Rectangle Enclosure and Point-Dominance Problems Revisited
We consider the problem of reporting the pairwise enclosures in a set of n axesparallel rectangles in IR2, which is equivalent to reporting dominance pairs in a set of n points in...
Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid...
COLT
1995
Springer
14 years 1 months ago
On Learning Bounded-Width Branching Programs
In this paper, we study PAC-leaming algorithms for specialized classes of deterministic finite automata (DFA). Inpartictdar, we study branchingprogrsms, and we investigate the int...
Funda Ergün, Ravi Kumar, Ronitt Rubinfeld
SPIRE
2000
Springer
14 years 1 months ago
A Word Stemming Algorithm for the Spanish Language
This paper describes a word stemming algorithm for the Spanish Language. Experiments in document retrieval regarding English text suggest that word stemming based on morphological...
Asunción Honrado, Ruben Leon, Ruairi O'Donn...
SIGGRAPH
2000
ACM
14 years 1 months ago
Out-of-core simplification of large polygonal models
We present an algorithm for out-of-core simplification of large polygonal datasets that are too complex to fit in main memory. The algorithm extends the vertex clustering scheme o...
Peter Lindstrom
ASPDAC
1995
ACM
66views Hardware» more  ASPDAC 1995»
14 years 1 months ago
Region definition and ordering assignment with the minimization of the number of switchboxes
--In this paper, a region definition and ordering assignment (RDAOA) algorithm on minimizing the number of switchboxes is proposed. The time complexity of the algorithm is proved t...
Jin-Tai Yan
SARA
2000
Springer
14 years 1 months ago
Improving the Efficiency of Reasoning Through Structure-Based Reformulation
We investigate the possibility of improving the efficiency of reasoning through structure-based partitioning of logical theories, combined with partitionbased logical reasoning str...
Eyal Amir, Sheila A. McIlraith
RSCTC
2000
Springer
151views Fuzzy Logic» more  RSCTC 2000»
14 years 1 months ago
Anytime Algorithm for Feature Selection
Feature selection is used to improve performance of learning algorithms by finding a minimal subset of relevant features. Since the process of feature selection is computationally ...
Mark Last, Abraham Kandel, Oded Maimon, Eugene Ebe...