Find:

Searching for PHRASE benny w c kwok.

Restrict to:   Header   Title   Order by:   Expected citations   Hubs   Usage   Date   Try:   Google (CiteSeer)   Google (Web)   Yahoo!   MSN   CSB   DBLP
No documents match Boolean query. Trying non-Boolean relevance query.
500 documents found. Only retrieving 250 documents (System busy - maximum reduced). Order: relevance to query.

Random Regular Graphs of High Degree - Krivelevich, Sudakov, Vu, Wormald   (Correct)   (4 citations)
graphs of high degree Michael Krivelevich Benny Sudakov y Van H. Vu z Nicholas C. Wormald x
Benny Sudakov y Van H. Vu z Nicholas C. Wormald x Abstract Random d-regular graphs have
www.math.tau.ac.il/~krivelev/34.ps

Analytical MMAP-based bounds for packet loss in.. - Develder, Van.. (2004)   (Correct)
with recirculating FDL bu#ers Chris Develder #Benny Van Houdt #Mario Pickavet Chris Blondia #
bounds for packet loss in optical packet switching with recirculating FDL bu#ers Chris Develder #
users.atlantis.ugent.be/cdvelder/publications/papers/journals/develder__MMAP_bounds_loss_OPS_FDL__pnet_sep_2004.ps

Non-Linear Back-propagation: Doing Back-Propagation.. - Hertz, Krogh.. (1994)   (Correct)   (2 citations)
the Activation Function. John Hertz, Anders Krogh, Benny Lautrup, Torsten Lehmann Abstract-The
1 Non-Linear Back-propagation: Doing Back-Propagation without Derivatives of the Activation Function. John
genome.cbs.dtu.dk/krogh/papers/nonlin.ps.gz

Combinatorial Auctions with Decreasing Marginal Utilities - Lehmann, Lehmann (2001)   (Correct)   (22 citations)
Auctions with Decreasing Marginal Utilities 1 2 Benny Lehmann Digital Fuel E-mail: benny@digifuel.com
Combinatorial Auctions with Decreasing Marginal Utilities 1 2 Benny
www.cs.huji.ac.il/%7Elehmann/papers/mechanisms/LLN.ps

Fairplay - A Secure Two-Party Computation System - Malkhi, Nisan, Pinkas, Sella (2004)   (Correct)   (4 citations)
System Dahlia Malkhi #Noam Nisan Benny Pinkas #and Yaron Sella February 1, 2004
Abstract Advances in modern cryptography coupled with rapid growth in processing and communication
www.cs.huji.ac.il/~noam/fairplay.pdf

On Privacy and Partition Arguments - Chor, Ishai   (Correct)
On Privacy and Partition Arguments 1 Benny Chor 2 and Yuval Ishai 3 Department of
from the execution of the protocol other than what follows from their inputs and the value of f .
www.cs.technion.ac.il/~yuvali/./pubs/CI01.ps

Privacy, Additional Information, and Communication - Bar-Yehuda, Chor..   (Correct)
and Communication Reuven Bar-Yehuda y Benny Chor z Eyal Kushilevitz x Alon Orlitsky
to determine the value of the function. Each party wants to expose as little of its input as possible to
www.cs.technion.ac.il/~eyalk/BCKO.ps.Z

Executing Reactive Behavior for Autonomous Navigation.. - Rochwerger, al. (1994)   (Correct)   (1 citation)
for Autonomous Navigation #Extended Abstract# BennyRochwerger Claude L. Fennema Bruce Draper
time to a changing environment and to #reason"about ways to achieve its goals. This paper describes the
Navigation #Extended Abstract# BennyRochwerger Claude L. Fennema Bruce Draper Allen R. Hanson
www.cs.colostate.edu/~draper/publications/rochwerger_cvpr94.pdf

Efficient State Updates for Key Management - Pinkas (2001)   (Correct)   (2 citations)
E#cient State Updates for Key Management Benny Pinkas HP Labs Princeton, NJ, USA
NJ, USA benny.pinkas@hp.com Abstract Encryption is widely used to enforce usage rules for digital
www278.pair.com/bennyp/PAPERS/stateupdates.ps

Privacy Preserving Data Mining - Lindell, Pinkas (2000)   (Correct)   (77 citations)
Preserving Data Mining Yehuda Lindell 1 and Benny Pinkas 2? 1 Department of Computer Science and
1 Department of Computer Science and Applied Math, Weizmann Institute of Science, Rehovot, Israel.
www.wisdom.weizmann.ac.il/~lindell/PAPERS/id3-crypto00.ps.gz

On the Security of Pay-Per-Click and Other Web.. - Anupam, Mayer, Nissim..   (Correct)   (10 citations)
alaing@research.bell-labs.com Kobbi Nissim Benny Pinkas Department of Computer Science and
On the Security of Pay-Per-Click and Other Web Advertising Schemes Vinod Anupam Alain Mayer
www.bell-labs.com/user/alain/papers/v17.ps.gz

A Componentized Architecture for Dynamic Electronic Markets - Reich, Ben-Shaul (1998)   (Correct)   (2 citations)
Architecture for Dynamic Electronic Markets Benny Reich Israel Ben-Shaul Department of Electrical
to explore genericity in market design. In this paper we present a domain-speci c software architecture
www.dsg.technion.ac.il/gem/papers/gem-sigmodrec.ps.gz

Rectilinear Trees under Rotation and Related Problems.. - Nielsen, Winter.. (2002)   (Correct)
Rotation and Related Problems Extended Abstract] Benny K. Nielsen Dept. of Computer Science University
DK-2100 Copenhagen Denmark benny@diku.dk Pawel Winter Dept. of Computer Science University of
ftp.diku.dk/pub/diku/users/martinz/rotmst.ps

Applying Formal Methods in Industry The UseGat Project - Sandro Bologna Rocco   (Correct)
2 Gino BIONDI 2 Carmen PORZIA 2 Benny Graft MORTENSEN 3 and Niels KIRKEGAARD 3 1
partially funded by the European Communities, with the goal to measure difficulties and benefits
tisgi.casaccia.enea.it/reports/safecomp98.ps

Asymptotically Optimal Tree-Packings in Regular Graphs - Kelmans, Mubayi, Sudakov (2001)   (Correct)   (2 citations)
graphs Alexander Kelmans Dhruv Mubayi y Benny Sudakov z Abstract Let T be a tree with t
Mubayi y Benny Sudakov z Abstract Let T be a tree with t vertices. Clearly, an n vertex graph contains
Sudakov z Abstract Let T be a tree with t vertices. Clearly, an n vertex graph contains at most n=t
www.math.princeton.edu/~bsudakov/treepack.ps.gz

Approximating Coloring and Maximum Independent Sets.. - Krivelevich.. (2001)   (Correct)   (3 citations)
Michael Krivelevich Ram Nathaniel y Benny Sudakov z 1 Introduction Approximate coloring
and Sudakov [11] developed a coloring algorithm with approximation ratio O(n(log log n= log n) 2
Approximating coloring and maximum independent sets in 3-uniform
www.math.tau.ac.il/~krivelev/32conf.ps

Visualization of Neural Networks Using Saliency Maps - Mørch, Kjems, Hansen.. (1995)   (Correct)   (1 citation)
Lars Kai Hansen Claus Svarer z Ian Law z Benny Lautrup y Steve Strother Kelly Rehm
embedded in feed-forward neural networks, with emphasis on the ill-posed case, where the
eivind.imm.dtu.dk/dist/1995/nmorch.icnn95.ps.Z

Driving Vision by Topology - Rothwell Mundy (1994)   (Correct)   (4 citations)
by Topology C.A. Rothwell J.L. Mundy y W. Hoffman y and V.D. Nguyen y INRIA, 2004,
ftp-robotvis.inria.fr/pub/html/Papers/rothwell-mundy-etal:95.ps.gz

Constrained REDO: An Alternative to REPLAY - Liew, Steinberg (1993)   (Correct)
Constrained REDO: An Alternative to REPLAY C. W. Liew L. I. Steinberg Department of Computer
www.cs.rutgers.edu/pub/technical-reports/cap-tr-13.ps.Z

First 20 documents  Next 20

Try your query at:   Google (CiteSeer)   Google (Web)   Yahoo!   MSN   CSB   DBLP

CiteSeer.IST - Copyright Penn State and NEC