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

CiteSeerX logo

Advanced Search Include Citations

Tools

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

Generation of Iris Template for recognition of Iris in Efficient Manner

by Ruchika Gupta, Harish Saini
"... Abstract- To find a fast, effective iris template aimed at speeding up the iris localization, normalization and feature extraction process and increasing their precision. Iris localization is the main part of any iris recognition system as the success of any Biometrics system depends on the accurate ..."
Abstract - Add to MetaCart
an efficient localization, normalization and encoding algorithm may achieve the said objective for our problem. The algorithm requires iris image database of individuals. Dougman’s function is used for localization, rubber sheet model for normalization and labor masek feature extraction function for fast

An Efficient Boosting Algorithm for Combining Preferences

by Raj Dharmarajan Iyer , Jr. , 1999
"... The problem of combining preferences arises in several applications, such as combining the results of different search engines. This work describes an efficient algorithm for combining multiple preferences. We first give a formal framework for the problem. We then describe and analyze a new boosting ..."
Abstract - Cited by 707 (18 self) - Add to MetaCart
The problem of combining preferences arises in several applications, such as combining the results of different search engines. This work describes an efficient algorithm for combining multiple preferences. We first give a formal framework for the problem. We then describe and analyze a new

Cilk: An Efficient Multithreaded Runtime System

by Robert D. Blumofe , Christopher F. Joerg, Bradley C. Kuszmaul, Charles E. Leiserson, Keith H. Randall, Yuli Zhou - JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING , 1995
"... Cilk (pronounced "silk") is a C-based runtime system for multithreaded parallel programming. In this paper, we document the efficiency of the Cilk work-stealing scheduler, both empirically and analytically. We show that on real and synthetic applications, the "work" and "cri ..."
Abstract - Cited by 750 (40 self) - Add to MetaCart
Cilk (pronounced "silk") is a C-based runtime system for multithreaded parallel programming. In this paper, we document the efficiency of the Cilk work-stealing scheduler, both empirically and analytically. We show that on real and synthetic applications, the "work" and "

An Efficient Routing Protocol for Wireless Networks

by Shree Murthy, J. J. Garcia-Luna-Aceves , 1996
"... We present ..."
Abstract - Cited by 533 (15 self) - Add to MetaCart
We present

Ptolemy: A Framework for Simulating and Prototyping Heterogeneous Systems

by Joseph Buck, Soonhoi Ha, Edward A. Lee, David G. Messerschmitt , 1992
"... Ptolemy is an environment for simulation and prototyping of heterogeneous systems. It uses modern object-oriented software technology (C++) to model each subsystem in a natural and efficient manner, and to integrate these subsystems into a whole. Ptolemy encompasses practically all aspects of design ..."
Abstract - Cited by 569 (90 self) - Add to MetaCart
Ptolemy is an environment for simulation and prototyping of heterogeneous systems. It uses modern object-oriented software technology (C++) to model each subsystem in a natural and efficient manner, and to integrate these subsystems into a whole. Ptolemy encompasses practically all aspects

A Model of Saliency-based Visual Attention for Rapid Scene Analysis

by Laurent Itti, Christof Koch, Ernst Niebur , 1998
"... A visual attention system, inspired by the behavior and the neuronal architecture of the early primate visual system, is presented. Multiscale image features are combined into a single topographical saliency map. A dynamical neural network then selects attended locations in order of decreasing salie ..."
Abstract - Cited by 1694 (70 self) - Add to MetaCart
saliency. The system breaks down the complex problem of scene understanding by rapidly selecting, in a computationally efficient manner, conspicuous locations to be analyzed in detail. Index terms: Visual attention, scene analysis, feature extraction, target detection, visual search. \Pi I. Introduction

Random Oracles are Practical: A Paradigm for Designing Efficient Protocols

by Mihir Bellare, Phillip Rogaway , 1995
"... We argue that the random oracle model -- where all parties have access to a public random oracle -- provides a bridge between cryptographic theory and cryptographic practice. In the paradigm we suggest, a practical protocol P is produced by first devising and proving correct a protocol P R for the ..."
Abstract - Cited by 1643 (75 self) - Add to MetaCart
for the random oracle model, and then replacing oracle accesses by the computation of an "appropriately chosen" function h. This paradigm yields protocols much more efficient than standard ones while retaining many of the advantages of provable security. We illustrate these gains for problems including

On the Construction of Energy-Efficient Broadcast and Multicast Trees in Wireless Networks

by Jeffrey E. Wieselthier, Gam D. Nguyen, Anthony Ephremides , 2000
"... wieselthier @ itd.nrl.navy.mil nguyen @ itd.nrl.navy.mil ..."
Abstract - Cited by 554 (13 self) - Add to MetaCart
wieselthier @ itd.nrl.navy.mil nguyen @ itd.nrl.navy.mil

Maté: A Tiny Virtual Machine for Sensor Networks

by Philip Levis, David Culler , 2002
"... Composed of tens of thousands of tiny devices with very limited resources ("motes"), sensor networks are subject to novel systems problems and constraints. The large number of motes in a sensor network means that there will often be some failing nodes; networks must be easy to repopu-late. ..."
Abstract - Cited by 502 (21 self) - Add to MetaCart
capsules enable the deploy-ment of ad-hoc routing and data aggregation algorithms. Maté's concise, high-level program representation simplifies programming and allows large networks to be frequently re-programmed in an energy-efficient manner; in addition, its safe execution environment suggests a use

Spray and Wait: An Efficient Routing Scheme for Intermittently Connected Mobile Networks

by Thrasyvoulos Spyropoulos, Konstantinos Psounis, Cauligi S. Raghavendra - SIGCOMM'05 , 2005
"... Intermittently connected mobile networks are sparse wireless networks where most of the time there does not exist a complete path from the source to the destination. These networks ..."
Abstract - Cited by 477 (9 self) - Add to MetaCart
Intermittently connected mobile networks are sparse wireless networks where most of the time there does not exist a complete path from the source to the destination. These networks
Next 10 →
Results 1 - 10 of 1,064,830
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