Sciweavers

1523 search results - page 77 / 305
» Partially ordered secretaries
Sort
View
115
Voted
LPNMR
1993
Springer
15 years 4 months ago
Negation as Partial Failure
We present a logic programming language which uses a four-valued bilattice as the underlying framework for semantics of programs. The two orderings of the bilattice reflect the c...
Bamshad Mobasher, Jacek Leszczylowski, Don Pigozzi
ANLP
1994
97views more  ANLP 1994»
15 years 2 months ago
Recycling Terms into a Partial Parser
Both full-text information retrieval and large scale parsing require text preprocessing to identify strong lexical associations in textual databases. In order to associate linguis...
Christian Jacquemin
117
Voted
JOC
2002
99views more  JOC 2002»
15 years 9 days ago
The Insecurity of the Digital Signature Algorithm with Partially Known Nonces
We present a polynomial-time algorithm that provably recovers the signer's secret DSA key when a few bits of the random nonces k (used at each signature generation) are known ...
Phong Q. Nguyen, Igor Shparlinski
CDC
2010
IEEE
147views Control Systems» more  CDC 2010»
14 years 4 months ago
Partial pole placement with minimum norm controller
— The problem of placing an arbitrary subset (m) of the (n) closed loop eigenvalues of a nth order continuous time single input linear time invariant(LTI) system, using full stat...
Subashish Datta, Balarko Chaudhuri, Debraj Chakrab...
79
Voted
INFOCOM
2002
IEEE
15 years 5 months ago
Exact sampling of TCP Window States
We demonstrate how to apply Coupling from the Past, a simulation technique for exact sampling, to Markov chains based on TCP variants. This approach provides a new, statistically ...
Ashish Goel, Michael Mitzenmacher