Sciweavers

5055 search results - page 695 / 1011
» Relative Timing
Sort
View
211
Voted
NEUROSCIENCE
2001
Springer
15 years 11 months ago
Biological Grounding of Recruitment Learning and Vicinal Algorithms in Long-Term Potentiation
Biological networks are capable of gradual learning based on observing a large number of exemplars over time as well as of rapidly memorizing specific events as a result of a sin...
Lokendra Shastri
NSF
2001
Springer
225views Computer Vision» more  NSF 2001»
15 years 11 months ago
Content-Based Networking: A New Communication Infrastructure
Abstract. We argue that the needs of many classes of modern applications, especially those targeted at mobile or wireless computing, demand the services of content-based publish/su...
Antonio Carzaniga, Alexander L. Wolf
OHS
2001
Springer
15 years 11 months ago
FOHM+RTSP: Applying Open Hypermedia and Temporal Linking to Audio Streams
Abstract. The World Wide Web (WWW) was originally designed to handle relatively simple files, containing just text and graphics. With the development of more advanced Web browsers...
Neil Ridgway, David De Roure
OOPSLA
2001
Springer
15 years 11 months ago
Points-To Analysis for Java using Annotated Constraints
The goal of points-to analysis for Java is to determine the set of objects pointed to by a reference variable or a reference object field. This information has a wide variety of ...
Atanas Rountev, Ana Milanova, Barbara G. Ryder
SACRYPT
2001
Springer
123views Cryptology» more  SACRYPT 2001»
15 years 11 months ago
Weaknesses in the Key Scheduling Algorithm of RC4
Abstract. Inthis paper we present several weaknesses in the keyscheduling algorithm of RC4, and describe their cryptanalytic signi cance. We identify a large number of weak keys, i...
Scott R. Fluhrer, Itsik Mantin, Adi Shamir