Sciweavers

2157 search results - page 306 / 432
» Binary ant algorithm
Sort
View
ECML
2006
Springer
15 years 7 months ago
B-Matching for Spectral Clustering
We propose preprocessing spectral clustering with b-matching to remove spurious edges in the adjacency graph prior to clustering. B-matching is a generalization of traditional maxi...
Tony Jebara, Vlad Shchogolev
DAS
2010
Springer
15 years 6 months ago
Overlapped text segmentation using Markov random field and aggregation
Separating machine printed text and handwriting from overlapping text is a challenging problem in the document analysis field and no reliable algorithms have been developed thus f...
Xujun Peng, Srirangaraj Setlur, Venu Govindaraju, ...
FPGA
2008
ACM
191views FPGA» more  FPGA 2008»
15 years 6 months ago
A hardware framework for the fast generation of multiple long-period random number streams
Stochastic simulations and other scientific applications that depend on random numbers are increasingly implemented in a parallelized manner in programmable logic. High-quality ps...
Ishaan L. Dalal, Deian Stefan
ALENEX
2007
126views Algorithms» more  ALENEX 2007»
15 years 6 months ago
0/1 Vertex and Facet Enumeration with BDDs
In polyhedral studies of 0/1 polytopes two prominent problems exist. One is the vertex enumeration problem: Given a system of inequalities, enumerate its feasible 0/1 points. Anot...
Markus Behle, Friedrich Eisenbrand
140
Voted
DAGSTUHL
2007
15 years 6 months ago
The Unique Games Conjecture with Entangled Provers is False
We consider one-round games between a classical verifier and two provers who share entanglement. We show that when the constraints enforced by the verifier are ‘unique’ cons...
Julia Kempe, Oded Regev, Ben Toner