4591 search results - page 305 / 919 » The Global Computer |
148
click to vote
TCS
2008
15 years 4 months ago
2008
The problem of computing approximate GCDs of several polynomials with real or complex coefficients can be formulated as computing the minimal perturbation such that the perturbed ...
149
Voted
PERCOM
2010
ACM
15 years 3 months ago
2010
ACM
—We are witnessing a tremendous hype on the Internet of Things paradigm, with not only research projects, but also commercial products claiming to implement its fundamental mecha...
235
Voted
CVPR
2011
IEEE
15 years 13 days ago
2011
IEEE
We propose a new family of non-submodular global energy functions that still use submodularity internally to couple edges in a graph cut. We show it is possible to develop an efï¬...
162
click to vote
COLING
2010
15 years 6 hour ago
2010
We propose to analyse semantic similarity in comparable text by matching syntactic trees and labeling the alignments according to one of five semantic similarity relations. We pre...
144
click to vote
ICCV
2011
IEEE
14 years 5 months ago
2011
IEEE
In the security domain a key problem is identifying rare behaviours of interest. Training examples for these behaviours may or may not exist, and if they do exist there will be fe...