849 search results - page 44 / 170 » On the Complexity of the Whitehead Minimization Problem |
EAAI
2007
13 years 7 months ago
2007
Multi-agent systems are widely used to address large-scale distributed combinatorial applications in the real world. One such application is meeting scheduling (MS), which is deļ¬...
APPROX
2009
Springer
14 years 2 months ago
2009
Springer
The Nearest Codeword Problem (NCP) is a basic algorithmic question in the theory of error-correcting codes. Given a point v ā Fn 2 and a linear space L ā Fn 2 of dimension k NC...
CVPR
2007
IEEE
14 years 2 months ago
2007
IEEE
Energy-minimizing active contour models (snakes) have been proposed for solving many computer vision problems such as object segmentation, surface reconstruction, and object track...
ICDT
2010
ACM
14 years 20 days ago
2010
ACM
The paper formulates and investigates the aggregation problem for synthesized mediators of Web services (SWMs). An SWM is a ļ¬nite-state transducer deļ¬ned in terms of templates...
CRYPTO
2005
Springer
14 years 1 months ago
2005
Springer
Motivated by database search problems such as partial match or nearest neighbor, we present secure multiparty computation protocols for constant-depth circuits. Speciļ¬cally, for ...