• 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 6,376
Next 10 →

IT IS NOT AN EASY TASK TO MAINTAIN THE MESSAGE contained in

by Maria Inêz, Probst Lucena
"... one language when it is translated into another. Words, sentences and paragraphs have to be analysed and restructured to convey the most appropriate meaning in the culture to which the translation is ..."
Abstract - Add to MetaCart
one language when it is translated into another. Words, sentences and paragraphs have to be analysed and restructured to convey the most appropriate meaning in the culture to which the translation is

Easy Tasks Dominate Information Retrieval Evaluation Results

by Thomas Mandl
"... Abstract: The evaluation of information retrieval systems involves the creation of potential user needs for which systems try to find relevant documents. The difficulty of these topics differs greatly and final scores for systems are typically based on the mean average. However, the topics which are ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
are relatively easy to solve, have a much larger impact on the final system ranking than hard topics. This paper presents a novel methodology to measure that effect. The results of a large evaluation experiment with 100 topics from the Cross Language Evaluation Forum (CLEF) allow a split of the topics into four

A Singular Value Thresholding Algorithm for Matrix Completion

by Jian-Feng Cai, Emmanuel J. Candès, Zuowei Shen , 2008
"... This paper introduces a novel algorithm to approximate the matrix with minimum nuclear norm among all matrices obeying a set of convex constraints. This problem may be understood as the convex relaxation of a rank minimization problem, and arises in many important applications as in the task of reco ..."
Abstract - Cited by 555 (22 self) - Add to MetaCart
This paper introduces a novel algorithm to approximate the matrix with minimum nuclear norm among all matrices obeying a set of convex constraints. This problem may be understood as the convex relaxation of a rank minimization problem, and arises in many important applications as in the task

Pregel: A system for large-scale graph processing

by Grzegorz Malewicz, Matthew H. Austern, Aart J. C. Bik, James C. Dehnert, Ilan Horn, Naty Leiser, Grzegorz Czajkowski - IN SIGMOD , 2010
"... Many practical computing problems concern large graphs. Standard examples include the Web graph and various social networks. The scale of these graphs—in some cases billions of vertices, trillions of edges—poses challenges to their efficient processing. In this paper we present a computational model ..."
Abstract - Cited by 496 (0 self) - Add to MetaCart
model suitable for this task. Programs are expressed as a sequence of iterations, in each of which a vertex can receive messages sent in the previous iteration, send messages to other vertices, and modify its own state and that of its outgoing edges or mutate graph topology. This vertex-centric approach

The Effects of Sonic Environment of Individualized Instruction In Learning Difficult and Easy Tasks by

by R Epor, T Resumes, By- Mccarthy, Edward H, High Achievers, Edward H. Mc Carthy
"... POSITION OR POLICY. School plant facilities in Metropolitan areas are unavoidably. subjected to extraneous noises from automobiles, trucks, airplanes, trains, commerce, and industry; in addition, extraneous noises from within the school plant are audible within the classroom, including: ..."
Abstract - Add to MetaCart
POSITION OR POLICY. School plant facilities in Metropolitan areas are unavoidably. subjected to extraneous noises from automobiles, trucks, airplanes, trains, commerce, and industry; in addition, extraneous noises from within the school plant are audible within the classroom, including:

Pin: building customized program analysis tools with dynamic instrumentation

by Chi-keung Luk, Robert Cohn, Robert Muth, Harish Patil, Artur Klauser, Geoff Lowney, Steven Wallace, Vijay Janapa Reddi, Kim Hazelwood - IN PLDI ’05: PROCEEDINGS OF THE 2005 ACM SIGPLAN CONFERENCE ON PROGRAMMING LANGUAGE DESIGN AND IMPLEMENTATION , 2005
"... Robust and powerful software instrumentation tools are essential for program analysis tasks such as profiling, performance evaluation, and bug detection. To meet this need, we have developed a new instrumentation system called Pin. Our goals are to provide easy-to-use, portable, transparent, and eff ..."
Abstract - Cited by 991 (35 self) - Add to MetaCart
Robust and powerful software instrumentation tools are essential for program analysis tasks such as profiling, performance evaluation, and bug detection. To meet this need, we have developed a new instrumentation system called Pin. Our goals are to provide easy-to-use, portable, transparent

Loopy belief propagation for approximate inference: An empirical study. In:

by Kevin P Murphy , Yair Weiss , Michael I Jordan - Proceedings of Uncertainty in AI, , 1999
"... Abstract Recently, researchers have demonstrated that "loopy belief propagation" -the use of Pearl's polytree algorithm in a Bayesian network with loops -can perform well in the context of error-correcting codes. The most dramatic instance of this is the near Shannon-limit performanc ..."
Abstract - Cited by 676 (15 self) - Add to MetaCart
. Introduction The task of calculating posterior marginals on nodes in an arbitrary Bayesian network is known to be NP hard In this paper we investigate the approximation performance of "loopy belief propagation". This refers to using the well-known Pearl polytree algorithm [12] on a Bayesian network

Automation trust and reliance 1 OCCASIONAL AUTOMATION FAILURES ON EASY TASKS UNDERMINES TRUST IN AUTOMATION

by Poornima Madhavan, Douglas A. Wiegmann, Frank C. Lacson
"... Automation users often mistrust diagnostic aids that are imperfectly reliable (Parasuraman & Riley, 1997), particularly on occasions when automation errors appear conspicuous (c.f. Dzindolet, Peterson, Pomranky, Pierce, & Beck, in press), or simple to the user. Madhavan, Wiegmann, and Lacso ..."
Abstract - Add to MetaCart
, and Lacson, (2003) found that when operators catch easy mistakes made by an automated aid, it bolsters their self-confidence in their own ability to outperform the aid even on difficult tasks, resulting in automation under-trust and under-reliance. Specifically, Madhavan et al. proposed the “easy

Improving Classroom Behavior by Modifying Task Difficulty: Effects of Increasing the Difficulty of Too-Easy Tasks

by Um-Breit Blair , ; Bos , Blair , Umbreit , ; Eck , Dunlap , Foster-Johnson , Clarke , Kern , ; Childs , Dunlap
"... Abstract: This study examined the effects of increasing task difficulty when inadequately challenging tasks are assigned. Jason, a 10-year-old, typically developing Caucasian boy, attended a fourth-grade general education classroom at a public elementary school. During independent academic assignme ..."
Abstract - Add to MetaCart
Abstract: This study examined the effects of increasing task difficulty when inadequately challenging tasks are assigned. Jason, a 10-year-old, typically developing Caucasian boy, attended a fourth-grade general education classroom at a public elementary school. During independent academic

Hard and Easy Distributions of SAT Problems

by David Mitchell, Bart Selman, Hector Levesque , 1992
"... We report results from large-scale experiments in satisfiability testing. As has been observed by others, testing the satisfiability of random formulas often appears surprisingly easy. Here we show that by using the right distribution of instances, and appropriate parameter values, it is possible to ..."
Abstract - Cited by 255 (20 self) - Add to MetaCart
We report results from large-scale experiments in satisfiability testing. As has been observed by others, testing the satisfiability of random formulas often appears surprisingly easy. Here we show that by using the right distribution of instances, and appropriate parameter values, it is possible
Next 10 →
Results 1 - 10 of 6,376
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