849 search results - page 44 / 170 » On the Complexity of the Whitehead Minimization Problem |
175
click to vote
EAAI
2007
15 years 6 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ļ¬...
153
click to vote
APPROX
2009
Springer
16 years 21 days 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...
173
click to vote
CVPR
2007
IEEE
16 years 13 days 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...
178
click to vote
ICDT
2010
ACM
15 years 11 months 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...
169
click to vote
CRYPTO
2005
Springer
15 years 11 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 ...