Sciweavers

231 search results - page 12 / 47
» Two lower bounds for self-assemblies at temperature 1
Sort
View
HICSS
2008
IEEE
143views Biometrics» more  HICSS 2008»
15 years 3 months ago
Bounding Prefix Transposition Distance for Strings and Permutations
A transposition is an operation that exchanges two adjacent substrings. When it is restricted so that one of the substrings is a prefix, it is called a prefix transposition. The p...
Bhadrachalam Chitturi, Ivan Hal Sudborough
67
Voted
CGF
2005
133views more  CGF 2005»
14 years 9 months ago
Constrained Visualization Using the Shepard Interpolation Family
This paper discusses the problem of visualizing data where there are underlying constraints that must be preserved. For example, we may know that the data are inherently positive....
Ken W. Brodlie, Muhammed Rafiq Asim, Keith Unswort...
PKDD
2010
Springer
164views Data Mining» more  PKDD 2010»
14 years 7 months ago
Complexity Bounds for Batch Active Learning in Classification
Active learning [1] is a branch of Machine Learning in which the learning algorithm, instead of being directly provided with pairs of problem instances and their solutions (their l...
Philippe Rolet, Olivier Teytaud
WINE
2009
Springer
178views Economy» more  WINE 2009»
15 years 4 months ago
The Geometry of Truthfulness
We study the geometrical shape of the partitions of the input space created by the allocation rule of a truthful mechanism for multi-unit auctions with multidimensional types and ...
Angelina Vidali
CRYPTO
2008
Springer
186views Cryptology» more  CRYPTO 2008»
14 years 11 months ago
Communication Complexity in Algebraic Two-Party Protocols
In cryptography, there has been tremendous success in building various two-party protocols with small communication complexity out of homomorphic semantically-secure encryption sc...
Rafail Ostrovsky, William E. Skeith III