• 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 9,876
Next 10 →

A taxonomy of web search

by Andrei Broder - SIGIR FORUM , 2002
"... Classic IR (information retrieval) is inherently predicated on users searching for information, the socalled "information need". But the need behind a web search is often not informational -- it might be navigational (give me the url of the site I want to reach) or transactional (show me s ..."
Abstract - Cited by 655 (4 self) - Add to MetaCart
sites where I can perform a certain transaction, e.g. shop, download a file, or find a map). We explore this taxonomy of web searches and discuss how global search engines evolved to deal with web-specific needs.

Think globally, search locally

by Kamen Yotov, Keshav Pingali, Paul Stodghill - In ICS ’05: Proceedings of the 19th Annual International Conference on Supercomputing
"... A key step in program optimization is the determination of optimal values for code optimization parameters such as cache tile sizes and loop unrolling factors. One approach, which is implemented in most compilers, is to use analytical models to determine these values. The other approach, used in lib ..."
Abstract - Cited by 22 (0 self) - Add to MetaCart
in library generators like ATLAS, is to perform a global search over the space of parameter values by generating different versions of the code and executing them on the actual machine to find the parameter values that give the best performance. Neither approach is suitable for use in general

Finite-time analysis of the multiarmed bandit problem

by Peter Auer, Paul Fischer, Jyrki Kivinen - Machine Learning , 2002
"... Abstract. Reinforcement learning policies face the exploration versus exploitation dilemma, i.e. the search for a balance between exploring the environment to find profitable actions while taking the empirically best action as often as possible. A popular measure of a policy’s success in addressing ..."
Abstract - Cited by 817 (15 self) - Add to MetaCart
Abstract. Reinforcement learning policies face the exploration versus exploitation dilemma, i.e. the search for a balance between exploring the environment to find profitable actions while taking the empirically best action as often as possible. A popular measure of a policy’s success in addressing

Location-aided routing (LAR) in mobile ad hoc networks, in:

by Young-Bae Ko , Nitin H Vaidya - Proc. of MOBICOM , 1998
"... A mobile ad hoc network consists of wireless hosts that may move often. Movement of hosts results in a change in routes, requiring some mechanism for determining new routes. Several routing protocols have already been proposed for ad hoc networks. This paper suggests an approach to utilize location ..."
Abstract - Cited by 901 (10 self) - Add to MetaCart
location information (for instance, obtained using the global positioning system) to improve performance of routing protocols for ad hoc networks. By using location information, the proposed Location-Aided Routing (LAR) protocols limit the search for a new route to a smaller "request zone

Entropy-Based Algorithms For Best Basis Selection

by Ronald R. Coifman, Mladen Victor Wickerhauser - IEEE Transactions on Information Theory , 1992
"... pretations (position, frequency, and scale), and we have experimented with feature-extraction methods that use best-basis compression for front-end complexity reduction. The method relies heavily on the remarkable orthogonality properties of the new libraries. It is obviously a nonlinear transformat ..."
Abstract - Cited by 675 (20 self) - Add to MetaCart
, we can use information cost functionals defined for signals with normalized energy, since all expansions in a given library will conserve energy. Since two expansions will have the same energy globally, it is not necessary to normalize expansions to compare their costs. This feature greatly enlarges

Scaling Personalized Web Search

by Glen Jeh, Jennifer Widom - In Proceedings of the Twelfth International World Wide Web Conference , 2002
"... Recent web search techniques augment traditional text matching with a global notion of "importance" based on the linkage structure of the web, such as in Google's PageRank algorithm. For more refined searches, this global notion of importance can be specialized to create personalized ..."
Abstract - Cited by 409 (2 self) - Add to MetaCart
Recent web search techniques augment traditional text matching with a global notion of "importance" based on the linkage structure of the web, such as in Google's PageRank algorithm. For more refined searches, this global notion of importance can be specialized to create personalized

Searching for a Global Search Algorithm

by Sabine Dick, Thomas Santen , 1995
"... . We report on a case study to assess the use of an advanced knowledge-based software design technique with programmers who have not participated in the technique's development. We use the KIDS approach to algorithm design to construct two global search algorithms that route baggage through a t ..."
Abstract - Add to MetaCart
. We report on a case study to assess the use of an advanced knowledge-based software design technique with programmers who have not participated in the technique's development. We use the KIDS approach to algorithm design to construct two global search algorithms that route baggage through a

Searching for a Global Search Algorithm

by Sabine Dick Thomas, Thomas Santen
"... We report on a case study to assess the use of an advanced knowledge-based software design technique to programmers who have not participated in the technique 's development. We use the KIDS approach to algorithm design to construct two global search algorithms that route baggage through a tran ..."
Abstract - Add to MetaCart
We report on a case study to assess the use of an advanced knowledge-based software design technique to programmers who have not participated in the technique 's development. We use the KIDS approach to algorithm design to construct two global search algorithms that route baggage through a

Global Search for New Physics at CDF

by unknown authors , 809
"... Abstract. A model-independent global search for new physics has been performed at the CDF experiment. This search examines 399 final states, looking for discrepancies between observation and the standard model expectation in populations, kinematic shapes, bumps in mass distributions suggestive of ne ..."
Abstract - Add to MetaCart
Abstract. A model-independent global search for new physics has been performed at the CDF experiment. This search examines 399 final states, looking for discrepancies between observation and the standard model expectation in populations, kinematic shapes, bumps in mass distributions suggestive

A Global Search Architecture

by F. J. Burkowski, et al. , 1995
"... Recent advances in communication and storage technology make available vast quantities of on-line information. But this information is of limited use unless it can be searched effectively. Huge scale and heterogeneity of data raise a unique combination of architectural issues that must be addressed ..."
Abstract - Cited by 2 (0 self) - Add to MetaCart
Recent advances in communication and storage technology make available vast quantities of on-line information. But this information is of limited use unless it can be searched effectively. Huge scale and heterogeneity of data raise a unique combination of architectural issues that must be addressed
Next 10 →
Results 1 - 10 of 9,876
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