Sciweavers

4171 search results - page 410 / 835
» Choice numbers of graphs
Sort
View
ICML
2002
IEEE
16 years 7 months ago
Interpreting and Extending Classical Agglomerative Clustering Algorithms using a Model-Based approach
We present two results which arise from a model-based approach to hierarchical agglomerative clustering. First, we show formally that the common heuristic agglomerative clustering...
Sepandar D. Kamvar, Dan Klein, Christopher D. Mann...
STOC
2002
ACM
96views Algorithms» more  STOC 2002»
16 years 7 months ago
Near-optimal sparse fourier representations via sampling
d Abstract] A. C. Gilbert S. Guhay P. Indykz S. Muthukrishnan M. Strauss We give an algorithm for nding a Fourier representation R of B terms for a given discrete signal A of leng...
Anna C. Gilbert, Sudipto Guha, Piotr Indyk, S. Mut...
CSE
2009
IEEE
16 years 1 months ago
Tuning Evidence-Based Trust Models
Abstract—Many evidence-based trust models require the adjustment of parameters such as aging- or exploration-factors. What the literature often does not address is the systematic...
Eugen Staab, Thomas Engel
FCCM
2009
IEEE
189views VLSI» more  FCCM 2009»
16 years 1 months ago
Application Specific Customization and Scalability of Soft Multiprocessors
Although soft microprocessors are widely used in FPGAs, limited work has been performed regarding how to automatically and efficiently generate soft multiprocessors. In this paper...
Deepak Unnikrishnan, Jia Zhao, Russell Tessier
LICS
2009
IEEE
16 years 1 months ago
Substructural Operational Semantics as Ordered Logic Programming
We describe a substructural logic with ordered, linear, and persistent propositions and then endow a fragment with a committed choice forward-chaining operational interpretation. ...
Frank Pfenning, Robert J. Simmons