3244 search results - page 154 / 649 » On convex complexity measures |
114
click to vote
ICML
2007
IEEE
16 years 2 months ago
2007
IEEE
The k-Nearest Neighbors algorithm can be easily adapted to classify complex objects (e.g. sets, graphs) as long as a proper dissimilarity function is given over an input space. Bo...
127
click to vote
KBSE
2009
IEEE
15 years 8 months ago
2009
IEEE
Abstract—Test coverage such as branch coverage is commonly measured to assess the sufficiency of test inputs. To reduce tedious manual efforts in generating high-covering test i...
117
click to vote
FSTTCS
2009
Springer
15 years 8 months ago
2009
Springer
ABSTRACT. A non-local box is an abstract device into which Alice and Bob input bits x and y respectively and receive outputs a and b respectively, where a, b are uniformly distribu...
135
Voted
IMR
2003
Springer
15 years 7 months ago
2003
Springer
This paper proposes a method for predicting the complexity of meshing Computer Aided Design (CAD) geometries with unstructured, hexahedral, finite elements. Meshing complexity ref...
128
click to vote
EACL
1993
ACL Anthology
15 years 3 months ago
1993
ACL Anthology
Linguistic access to uncertain quantitative knowledge about physical properties is provided by dimensional adjectives, e.g. long-short in the spatial and temporal senses, near-far...