Sciweavers

569 search results - page 47 / 114
» acm 1995
Sort
View
COMPGEOM
1995
ACM
14 years 1 months ago
A New Technique for Analyzing Substructures in Arrangements
We present a simple but powerful new probabilistic technique for analyzing the combinatorial complexity of various substructures in arrangements of piecewise-linear surfaces in hig...
Boaz Tagansky
DAC
1995
ACM
14 years 1 months ago
A Method for Finding Good Ashenhurst Decompositions and Its Application to FPGA Synthesis
—In this paper, we present an algorithm for finding a good Ashenhurst decomposition of a switching function. Most current methods for performing this type of decomposition are ba...
Ted Stanion, Carl Sechen
ICDT
1995
ACM
105views Database» more  ICDT 1995»
14 years 1 months ago
Datalog Queries of Set Constraint Databases
Abstract. Extension of the relational database model to represent complex data has been a focus of much research in recent years. At the same time, an alternative extension of the ...
Peter Z. Revesz
STOC
1995
ACM
115views Algorithms» more  STOC 1995»
14 years 1 months ago
Geometric lower bounds for parametric matroid optimization
We relate the sequence of minimum bases of a matroid with linearly varying weights to three problems from combinatorial geometry: k-sets, lower envelopes of line segments, and con...
David Eppstein
CHI
1995
ACM
14 years 1 months ago
Pointing the Way: Active Collaborative Filtering
Collaborative filtering is based on the premise that people looking for information should be able to make use of what others have already found and evaluated. Current collaborati...
David Maltz, Kate Ehrlich