Sciweavers

10493 search results - page 1689 / 2099
» Dynamic Word Problems
Sort
View
122
Voted
CSUR
2000
101views more  CSUR 2000»
15 years 3 months ago
Extracting usability information from user interface events
to extract information at a level of abstraction that is useful to investigators interested in analyzing application usage or evaluating usability. This survey examines computer-ai...
David M. Hilbert, David F. Redmiles
157
Voted
CUZA
2002
130views more  CUZA 2002»
15 years 3 months ago
Distributed Threads in Java
In this paper we present a mechanism for serializing the execution-state of a distributed Java application that is implemented on a conventional Object Request Broker (ORB) archite...
Danny Weyns, Eddy Truyen, Pierre Verbaeten
146
Voted
JOC
2000
181views more  JOC 2000»
15 years 3 months ago
Security Arguments for Digital Signatures and Blind Signatures
Abstract. Since the appearance of public-key cryptography in the seminal DiffieHellman paper, many new schemes have been proposed and many have been broken. Thus, the simple fact t...
David Pointcheval, Jacques Stern
111
Voted
ORL
1998
68views more  ORL 1998»
15 years 3 months ago
A fast bipartite network flow algorithm for selective assembly
Bipartite network flow problems naturally arise in applications such as selective assembly and preemptive scheduling. This paper presents fast algorithms for these problems that ...
Satoru Iwata, Tomomi Matsui, S. Thomas McCormick
140
Voted
SIAMCOMP
2002
142views more  SIAMCOMP 2002»
15 years 3 months ago
On Binary Searching with Nonuniform Costs
Let us consider an ordered vector A[1 : n]. If the cost of testing each position is similar, then the standard binary search is the best strategy to search the vector. This is true...
Eduardo Sany Laber, Ruy Luiz Milidiú, Artur...
« Prev « First page 1689 / 2099 Last » Next »