Results 1 - 10 of 53,236

A Survey of Program Slicing Techniques

by F. Tip - JOURNAL OF PROGRAMMING LANGUAGES , 1995
"... A program slice consists of the parts of a program that (potentially) affect the values computed at some point of interest, referred to as a slicing criterion. The task of computing program slices is called program slicing. The original definition of a program slice was presented by Weiser in 197 ..."
Abstract - Cited by 790 (10 self) - Add to MetaCart
and efficiency. Moreover, the possibilities for combining solutions for different features are investigated....

Routing Techniques in Wireless Sensor Networks: A Survey

by Jamal N. Al-karaki, Ahmed E. Kamal - IEEE WIRELESS COMMUNICATIONS , 2004
"... Wireless Sensor Networks (WSNs) consist of small nodes with sensing, computation, and wireless communications capabilities. Many routing, power management, and data dissemination protocols have been specifically designed for WSNs where energy awareness is an essential design issue. The focus, howeve ..."
Abstract - Cited by 741 (2 self) - Add to MetaCart
S-based, and coherent-based depending on the protocol operation. We study the design tradeoffs between energy and communication overhead savings in every routing paradigm. We also highlight the advantages and performance issues of each routing technique. The paper concludes with possible future research areas.

Laplacian eigenmaps and spectral techniques for embedding and clustering.

by Mikhail Belkin , Partha Niyogi - Proceeding of Neural Information Processing Systems, , 2001
"... Abstract Drawing on the correspondence between the graph Laplacian, the Laplace-Beltrami op erator on a manifold , and the connections to the heat equation , we propose a geometrically motivated algorithm for constructing a representation for data sampled from a low dimensional manifold embedded in ..."
Abstract - Cited by 668 (7 self) - Add to MetaCart
of the manifold on which the data may possibly reside. Recently, there has been some interest (Tenenbaum et aI, 2000 ; The core algorithm is very simple, has a few local computations and one sparse eigenvalu e problem. The solution reflects th e intrinsic geom etric structure of the manifold. Th e justification

Efficient belief propagation for early vision

by Pedro F. Felzenszwalb, Daniel P. Huttenlocher - In CVPR , 2004
"... Markov random field models provide a robust and unified framework for early vision problems such as stereo, optical flow and image restoration. Inference algorithms based on graph cuts and belief propagation yield accurate results, but despite recent advances are often still too slow for practical u ..."
Abstract - Cited by 515 (8 self) - Add to MetaCart
use. In this paper we present new algorithmic techniques that substantially improve the running time of the belief propagation approach. One of our techniques reduces the complexity of the inference algorithm to be linear rather than quadratic in the number of possible labels for each pixel, which

Free-form deformation of solid geometric models

by Thomas W. Sederberg, Scott R. Parry - IN PROC. SIGGRAPH 86 , 1986
"... A technique is presented for deforming solid geometric models in a free-form manner. The technique can be used with any solid modeling system, such as CSG or B-rep. It can deform surface primitives of any type or degree: planes, quadrics, parametric surface patches, or implicitly defined surfaces, f ..."
Abstract - Cited by 701 (1 self) - Add to MetaCart
A technique is presented for deforming solid geometric models in a free-form manner. The technique can be used with any solid modeling system, such as CSG or B-rep. It can deform surface primitives of any type or degree: planes, quadrics, parametric surface patches, or implicitly defined surfaces

Low-Power CMOS Digital Design

by Anantha P. Chandrakasan, Samuel Sheng, Robert W. Brodersen - JOURNAL OF SOLID-STATE CIRCUITS. VOL 27, NO 4. APRIL 1992 413 , 1992
"... Motivated by emerging battery-operated applications that demand intensive computation in portable environments, techniques are investigated which reduce power consumption in CMOS digital circuits while maintaining computational throughput. Techniques for low-power operation are shown which use the ..."
Abstract - Cited by 580 (20 self) - Add to MetaCart
Motivated by emerging battery-operated applications that demand intensive computation in portable environments, techniques are investigated which reduce power consumption in CMOS digital circuits while maintaining computational throughput. Techniques for low-power operation are shown which use

Usability Analysis of Visual Programming Environments: a `cognitive dimensions' framework

by T. R. G. Green, M. Petre - JOURNAL OF VISUAL LANGUAGES AND COMPUTING , 1996
"... The cognitive dimensions framework is a broad-brush evaluation technique for interactive devices and for non-interactive notations. It sets out a small vocabulary of terms designed to capture the cognitively-relevant aspects of structure, and shows how they can be traded off against each other. T ..."
Abstract - Cited by 514 (13 self) - Add to MetaCart
The cognitive dimensions framework is a broad-brush evaluation technique for interactive devices and for non-interactive notations. It sets out a small vocabulary of terms designed to capture the cognitively-relevant aspects of structure, and shows how they can be traded off against each other

Incorporating non-local information into information extraction systems by Gibbs sampling

by Jenny Rose Finkel, Trond Grenager, Christopher Manning - IN ACL , 2005
"... Most current statistical natural language processing models use only local features so as to permit dynamic programming in inference, but this makes them unable to fully account for the long distance structure that is prevalent in language use. We show how to solve this dilemma with Gibbs sampling, ..."
Abstract - Cited by 730 (25 self) - Add to MetaCart
, a simple Monte Carlo method used to perform approximate inference in factored probabilistic models. By using simulated annealing in place of Viterbi decoding in sequence models such as HMMs, CMMs, and CRFs, it is possible to incorporate non-local structure while preserving tractable inference. We

The Entity-Relationship Model: Toward a Unified View of Data

by Peter Pin-shan Chen - ACM Transactions on Database Systems , 1976
"... A data model, called the entity-relationship model, is proposed. This model incorporates some of the important semantic information about the real world. A special diagrammatic technique is introduced as a tool for database design. An example of database design and description using the model and th ..."
Abstract - Cited by 1829 (6 self) - Add to MetaCart
A data model, called the entity-relationship model, is proposed. This model incorporates some of the important semantic information about the real world. A special diagrammatic technique is introduced as a tool for database design. An example of database design and description using the model

Status quo bias in decision making

by William Samuelson, Richard Zeckhauser - Journal of Risk and Uncertainty , 1988
"... economics, rationality Most real decisions, unlike those of economics texts, have a status quo alternative-that is, doing noth-ing or maintaining one’s current or previous decision. A series of decision-making experiments shows that individuals disproportionately stick with the status quo. Data on t ..."
Abstract - Cited by 641 (21 self) - Add to MetaCart
on the selections of health plans and retirement programs by faculty members reveal that the status quo bias is substantial in important real decisions. Economics, psychology, and decision theory provide possible explanations for this bias. Ap-plications are discussed ranging from marketing techniques
Results 1 - 10 of 53,236