• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 35,330
Next 10 →

Statistical pattern recognition: A review

by Anil K. Jain, Robert P. W. Duin, Jianchang Mao - IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE , 2000
"... The primary goal of pattern recognition is supervised or unsupervised classification. Among the various frameworks in which pattern recognition has been traditionally formulated, the statistical approach has been most intensively studied and used in practice. More recently, neural network techniques ..."
Abstract - Cited by 1035 (30 self) - Add to MetaCart
techniques and methods imported from statistical learning theory have bean receiving increasing attention. The design of a recognition system requires careful attention to the following issues: definition of pattern classes, sensing environment, pattern representation, feature extraction and selection

Data Preparation for Mining World Wide Web Browsing Patterns

by Robert Cooley, Bamshad Mobasher, Jaideep Srivastava - KNOWLEDGE AND INFORMATION SYSTEMS , 1999
"... The World Wide Web (WWW) continues to grow at an astounding rate in both the sheer volume of tra#c and the size and complexity of Web sites. The complexity of tasks such as Web site design, Web server design, and of simply navigating through a Web site have increased along with this growth. An i ..."
Abstract - Cited by 567 (43 self) - Add to MetaCart
The World Wide Web (WWW) continues to grow at an astounding rate in both the sheer volume of tra#c and the size and complexity of Web sites. The complexity of tasks such as Web site design, Web server design, and of simply navigating through a Web site have increased along with this growth

Design of capacity-approaching irregular low-density parity-check codes

by Thomas J. Richardson, M. Amin Shokrollahi, Rüdiger L. Urbanke - IEEE TRANS. INFORM. THEORY , 2001
"... We design low-density parity-check (LDPC) codes that perform at rates extremely close to the Shannon capacity. The codes are built from highly irregular bipartite graphs with carefully chosen degree patterns on both sides. Our theoretical analysis of the codes is based on [1]. Assuming that the unde ..."
Abstract - Cited by 588 (6 self) - Add to MetaCart
We design low-density parity-check (LDPC) codes that perform at rates extremely close to the Shannon capacity. The codes are built from highly irregular bipartite graphs with carefully chosen degree patterns on both sides. Our theoretical analysis of the codes is based on [1]. Assuming

Oceanstore: An architecture for global-scale persistent storage

by John Kubiatowicz, David Bindel, Yan Chen, Steven Czerwinski, Patrick Eaton, Dennis Geels, Ramakrishna Gummadi, Sean Rhea, Hakim Weatherspoon, Westley Weimer, Chris Wells, Ben Zhao , 2000
"... OceanStore is a utility infrastructure designed to span the globe and provide continuous access to persistent information. Since this infrastructure is comprised of untrusted servers, data is protected through redundancy and cryptographic techniques. To improve performance, data is allowed to be cac ..."
Abstract - Cited by 1149 (32 self) - Add to MetaCart
OceanStore is a utility infrastructure designed to span the globe and provide continuous access to persistent information. Since this infrastructure is comprised of untrusted servers, data is protected through redundancy and cryptographic techniques. To improve performance, data is allowed

XORs in the air: practical wireless network coding

by Sachin Katti, Hariharan Rahul, Wenjun Hu, Dina Katabi, Muriel Médard, Jon Crowcroft - In Proc. ACM SIGCOMM , 2006
"... This paper proposes COPE, a new architecture for wireless mesh networks. In addition to forwarding packets, routers mix (i.e., code) packets from different sources to increase the information content of each transmission. We show that intelligently mixing packets increases network throughput. Our de ..."
Abstract - Cited by 548 (20 self) - Add to MetaCart
design is rooted in the theory of network coding. Prior work on network coding is mainly theoretical and focuses on multicast traffic. This paper aims to bridge theory with practice; it addresses the common case of unicast traffic, dynamic and potentially bursty flows, and practical issues facing

The CES-D scale: A self-report depression scale for research in the general population

by Lenore Sawyer Radloff - Applied Psychological Measurement , 1977
"... The CES-D scale is a short self-report scale designed to measure depressive symptomatology in the general population. The items of the scale are symptoms associated with depression which have been used in previously validated longer scales. The new scale was tested in household interview surveys and ..."
Abstract - Cited by 2835 (1 self) - Add to MetaCart
The CES-D scale is a short self-report scale designed to measure depressive symptomatology in the general population. The items of the scale are symptoms associated with depression which have been used in previously validated longer scales. The new scale was tested in household interview surveys

Characteristics of a human cell line transformed by DNA from human adenovirus type 5

by F. L. Graham, J. Smileyt, W. C. Russell, R. Nairn , 1977
"... Human embryonic kidney cells have been transformed by exposing cells to sheared fragments of adenovirus type 5 DNA. The transformed cells (designated 293 cells) exhibited many of the characteristics of transformation including the elaboration of a virus-specific tumour antigen. Analysis of the polyp ..."
Abstract - Cited by 676 (14 self) - Add to MetaCart
Human embryonic kidney cells have been transformed by exposing cells to sheared fragments of adenovirus type 5 DNA. The transformed cells (designated 293 cells) exhibited many of the characteristics of transformation including the elaboration of a virus-specific tumour antigen. Analysis

Link-level Measurements from an 802.11b Mesh Network

by Daniel Aguayo, John Bicket, Sanjit Biswas, Glenn Judd, Robert Morris - In SIGCOMM , 2004
"... This paper anal yzes the causes of packetl oss in a 38-node urban mul ti-hop 802.11b network. The patterns and causes oflv# are important in the design of routing and errorcorrection proto colv as wel as in networkplqq"(v The paper makes the fol l owing observations. The distribution of inter-n ..."
Abstract - Cited by 567 (11 self) - Add to MetaCart
This paper anal yzes the causes of packetl oss in a 38-node urban mul ti-hop 802.11b network. The patterns and causes oflv# are important in the design of routing and errorcorrection proto colv as wel as in networkplqq"(v The paper makes the fol l owing observations. The distribution of inter

DSR: The Dynamic Source Routing Protocol for Multi-Hop Wireless Ad Hoc Networks”, in Ad Hoc Networking, edited by Charles E.

by David B Johnson , David A Maltz , Josh Broch - Perkins, Chapter , 2001
"... Abstract The Dynamic Source Routing protocol (DSR) is a simple and efficient routing protocol designed specifically for use in multi-hop wireless ad hoc networks of mobile nodes. DSR allows the network to be completely self-organizing and self-configuring, without the need for any existing network ..."
Abstract - Cited by 764 (8 self) - Add to MetaCart
Abstract The Dynamic Source Routing protocol (DSR) is a simple and efficient routing protocol designed specifically for use in multi-hop wireless ad hoc networks of mobile nodes. DSR allows the network to be completely self-organizing and self-configuring, without the need for any existing network

The capacity of wireless networks

by Piyush Gupta, P. R. Kumar - IEEE TRANSACTIONS ON INFORMATION THEORY , 2000
"... When n identical randomly located nodes, each capable of transmitting at bits per second and using a fixed range, form a wireless network, the throughput @ A obtainable by each node for a randomly chosen destination is 2 bits per second under a noninterference protocol. If the nodes are optimally p ..."
Abstract - Cited by 3243 (42 self) - Add to MetaCart
placed in a disk of unit area, traffic patterns are optimally assigned, and each transmission’s range is optimally chosen, the bit–distance product that can be transported by the network per second is 2 @ A bit-meters per second. Thus even under optimal circumstances, the throughput is only 2 bits per
Next 10 →
Results 1 - 10 of 35,330
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University