Sciweavers

146 search results - page 23 / 30
» Computably Enumerable Sets and Quasi-Reducibility
Sort
View
IPPS
2010
IEEE
13 years 8 months ago
Efficient and scalable parallel reconstruction of sibling relationships from genetic data in wild populations
Wild populations of organism are often difficult to study in their natural settings. Often, it is possible to infer mating information about these species by genotyping the offspri...
Saad I. Sheikh, Ashfaq A. Khokhar, Tanya Y. Berger...
CGO
2007
IEEE
14 years 5 months ago
Iterative Optimization in the Polyhedral Model: Part I, One-Dimensional Time
Emerging microprocessors offer unprecedented parallel computing capabilities and deeper memory hierarchies, increasing the importance of loop transformations in optimizing compile...
Louis-Noël Pouchet, Cédric Bastoul, Al...
GLOBECOM
2007
IEEE
14 years 5 months ago
Position Estimation Error in Edge Detection for Wireless Sensor Networks using Local Convex View
Abstract—Intuitively, identification of nodes close to the network edge is key to the successful setup, and continued operation, of many sensor network protocols and application...
Marwan Fayed, Hussein T. Mouftah
CAV
2007
Springer
164views Hardware» more  CAV 2007»
14 years 2 months ago
SAT-Based Compositional Verification Using Lazy Learning
Abstract. A recent approach to automated assume-guarantee reasoning (AGR) for concurrent systems relies on computing environment assumptions for components using the L algorithm fo...
Nishant Sinha, Edmund M. Clarke
SDM
2007
SIAM
204views Data Mining» more  SDM 2007»
14 years 10 days ago
Flexible Anonymization For Privacy Preserving Data Publishing: A Systematic Search Based Approach
k-anonymity is a popular measure of privacy for data publishing: It measures the risk of identity-disclosure of individuals whose personal information are released in the form of ...
Bijit Hore, Ravi Chandra Jammalamadaka, Sharad Meh...