Sciweavers

2031 search results - page 251 / 407
» On Tree-Constrained Matchings and Generalizations
Sort
View
DCC
2007
IEEE
15 years 9 months ago
Bit Recycling with Prefix Codes
Many data compression methods cannot remove all redundancy from a file that they compress because it can be encoded to many compressed files. In particular, we consider the redund...
Danny Dubé, Vincent Beaudoin
SODA
2010
ACM
214views Algorithms» more  SODA 2010»
15 years 7 months ago
A Fourier space algorithm for solving quadratic assignment problems
The quadratic assignment problem (QAP) is a central problem in combinatorial optimization. Several famous computationally hard tasks, such as graph matching, partitioning, and the...
Risi Kondor
EUROSYS
2007
ACM
15 years 7 months ago
Authorizing applications in singularity
We describe a new design for authorization in operating systems in which applications are first-class entities. In this design, principals reflect application identities. Access c...
Ted Wobber, Aydan R. Yumerefendi, Martín Ab...
ICCAD
2001
IEEE
101views Hardware» more  ICCAD 2001»
15 years 6 months ago
Instruction Generation for Hybrid Reconfigurable Systems
In this work, we present an algorithm for simultaneous template generation and matching. The algorithm profiles the graph and iteratively contracts edges to create the templates. ...
Ryan Kastner, Seda Ogrenci Memik, Elaheh Bozorgzad...
ISBI
2009
IEEE
15 years 4 months ago
Segmentation of Inflamed Synovia in Multi-Modal 3D MRI
We address the difficult problem of segmenting the inflamed synovial tissue in multi-modal 3D MR sequences of the wrist. The complex morphology of the structures to segment, the...
Curzio Basso, Matteo Santoro, Alessandro Verri, Ma...