Sciweavers

3656 search results - page 21 / 732
» Compact Location Problems
Sort
View
CHI
1994
ACM
14 years 1 months ago
The alphaslider: a compact and rapid selector
Research has suggested that rapid, serial, visual presentation of text (RSVP) may be an effective way to scan and search through lists of text strings in search of words, names, e...
Christopher Ahlberg, Ben Shneiderman
CPM
2010
Springer
180views Combinatorics» more  CPM 2010»
14 years 2 months ago
Algorithms for Three Versions of the Shortest Common Superstring Problem
Abstract. The input to the Shortest Common Superstring (SCS) problem is a set S of k words of total length n. In the classical version the output is an explicit word SCS(S) in whic...
Maxime Crochemore, Marek Cygan, Costas S. Iliopoul...
ACISP
2007
Springer
14 years 1 months ago
Practical Compact E-Cash
Compact e-cash schemes allow a user to withdraw a wallet containing k coins in a single operation, each of which the user can spend unlinkably. One big open problem for compact e-c...
Man Ho Au, Willy Susilo, Yi Mu
JSCIC
2008
48views more  JSCIC 2008»
13 years 9 months ago
A Level-Set Method for Computing the Eigenvalues of Elliptic Operators Defined on Compact Hypersurfaces
We demonstrate, through separation of variables and estimates from the semiclassical analysis of the Schr
Jeremy Brandman
NIPS
1993
13 years 11 months ago
Postal Address Block Location Using a Convolutional Locator Network
This paper describes the use of a convolutional neural network to perform address block location on machine-printed mail pieces. Locating the address block is a dicult object rec...
Ralph Wolf, John C. Platt