1984 search results - page 236 / 397 » The colourful feasibility problem |
152
click to vote
CHI
2005
ACM
16 years 6 months ago
2005
ACM
Our Translation Assistant applies common sense logic to the problem of translating speech in real time from one language to another. Using speech recognition combined with a softw...
145
click to vote
RECOMB
2002
Springer
16 years 6 months ago
2002
Springer
The field of algorithms for pairwisc biosequence similarity search is dominated by heuristic methods of high efficiency but uncertain sensitivity. One reason that more formal stri...
156
click to vote
STOC
2006
ACM
16 years 6 months ago
2006
ACM
We consider the problem of maximizing welfare when allocating m items to n players with subadditive utility functions. Our main result is a way of rounding any fractional solution...
171
click to vote
SDM
2009
SIAM
16 years 3 months ago
2009
SIAM
Given the pairwise affinity relations associated with a set of data items, the goal of a clustering algorithm is to automatically partition the data into a small number of homogen...
134
click to vote
ICCAD
2007
IEEE
16 years 3 months ago
2007
IEEE
—In the VLSI design process, a design implementation often needs to be corrected because of new specifications or design constraint violations. This correction process is referre...